TSTP Solution File: SWV267-2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWV267-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 19 12:14:39 EDT 2023
% Result : Unsatisfiable 2.57s 1.55s
% Output : Refutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 13 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 6 ~; 4 |; 0 &; 56 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(c_lessequals_type,type,
c_lessequals: $i > $i > $i > $o ).
thf(c_Message_Oparts_type,type,
c_Message_Oparts: $i > $i ).
thf(v_G_type,type,
v_G: $i ).
thf(v_H_type,type,
v_H: $i ).
thf(tc_set_type,type,
tc_set: $i > $i ).
thf(tc_Message_Omsg_type,type,
tc_Message_Omsg: $i ).
thf(1,negated_conjecture,
c_lessequals @ ( c_Message_Oparts @ v_G ) @ ( c_Message_Oparts @ v_H ) @ ( tc_set @ tc_Message_Omsg ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
thf(5,plain,
c_lessequals @ ( c_Message_Oparts @ v_G ) @ ( c_Message_Oparts @ v_H ) @ ( tc_set @ tc_Message_Omsg ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,negated_conjecture,
~ ( c_lessequals @ v_G @ ( c_Message_Oparts @ v_H ) @ ( tc_set @ tc_Message_Omsg ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
thf(6,plain,
~ ( c_lessequals @ v_G @ ( c_Message_Oparts @ v_H ) @ ( tc_set @ tc_Message_Omsg ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] : ( c_lessequals @ A @ ( c_Message_Oparts @ A ) @ ( tc_set @ tc_Message_Omsg ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__increasing_0) ).
thf(8,plain,
! [A: $i] : ( c_lessequals @ A @ ( c_Message_Oparts @ A ) @ ( tc_set @ tc_Message_Omsg ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( c_lessequals @ A @ B @ ( tc_set @ C ) )
| ~ ( c_lessequals @ D @ A @ ( tc_set @ C ) )
| ( c_lessequals @ D @ B @ ( tc_set @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).
thf(9,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ~ ( c_lessequals @ A @ B @ ( tc_set @ C ) )
| ~ ( c_lessequals @ D @ A @ ( tc_set @ C ) )
| ( c_lessequals @ D @ B @ ( tc_set @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(14,plain,
$false,
inference(e,[status(thm)],[5,6,8,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV267-2 : TPTP v8.1.2. Released v3.2.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 19 02:41:34 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.96/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/0.94 % [INFO] Parsing done (106ms).
% 1.22/0.95 % [INFO] Running in sequential loop mode.
% 1.63/1.16 % [INFO] eprover registered as external prover.
% 1.63/1.17 % [INFO] cvc4 registered as external prover.
% 1.63/1.17 % [INFO] Scanning for conjecture ...
% 1.72/1.22 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.83/1.24 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.86/1.25 % [INFO] Problem is propositional (TPTP CNF).
% 1.86/1.25 % [INFO] Type checking passed.
% 1.86/1.25 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 2.57/1.55 % External prover 'e' found a proof!
% 2.57/1.55 % [INFO] Killing All external provers ...
% 2.57/1.55 % Time passed: 1033ms (effective reasoning time: 593ms)
% 2.57/1.55 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.57/1.55 % Axioms used in derivation (2): cls_Message_Oparts__increasing_0, cls_Set_Osubset__trans_0
% 2.57/1.55 % No. of inferences in proof: 9
% 2.57/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1033 ms resp. 593 ms w/o parsing
% 2.57/1.57 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.57/1.57 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------