TSTP Solution File: LCL218-10 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n012.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 11:29:48 EDT 2023
% Result : Unsatisfiable 30.28s 5.47s
% Output : Refutation 30.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 18
% Syntax : Number of formulae : 29 ( 21 unt; 8 typ; 0 def)
% Number of atoms : 21 ( 20 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 206 ( 2 ~; 0 |; 0 &; 204 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 40 ( 0 ^; 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_type,type,
theorem: $i > $i ).
thf(or_type,type,
or: $i > $i > $i ).
thf(not_type,type,
not: $i > $i ).
thf(p_type,type,
p: $i ).
thf(q_type,type,
q: $i ).
thf(true_type,type,
true: $i ).
thf(ifeq_type,type,
ifeq: $i > $i > $i > $i > $i ).
thf(axiom_type,type,
axiom: $i > $i ).
thf(7,axiom,
! [C: $i,B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ ( not @ A ) @ B ) ) @ ( or @ ( not @ ( or @ C @ A ) ) @ ( or @ C @ B ) ) ) )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
thf(24,plain,
! [C: $i,B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ ( not @ A ) @ B ) ) @ ( or @ ( not @ ( or @ C @ A ) ) @ ( or @ C @ B ) ) ) )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq @ A @ A @ B @ C )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
thf(14,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq @ A @ A @ B @ C )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,axiom,
! [B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
thf(20,plain,
! [B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ B ) ) @ ( or @ B @ A ) ) )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(9,axiom,
! [B: $i,A: $i] :
( ( ifeq @ ( theorem @ A ) @ true @ ( ifeq @ ( axiom @ ( or @ ( not @ A ) @ B ) ) @ true @ ( theorem @ B ) @ true ) @ true )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
thf(28,plain,
! [B: $i,A: $i] :
( ( ifeq @ ( theorem @ A ) @ true @ ( ifeq @ ( axiom @ ( or @ ( not @ A ) @ B ) ) @ true @ ( theorem @ B ) @ true ) @ true )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ ( or @ B @ C ) ) ) @ ( or @ B @ ( or @ A @ C ) ) ) )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ ( or @ B @ C ) ) ) @ ( or @ B @ ( or @ A @ C ) ) ) )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( axiom @ ( or @ ( not @ A ) @ ( or @ B @ A ) ) )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
thf(16,plain,
! [A: $i] :
( ( axiom @ ( or @ ( not @ ( or @ A @ A ) ) @ A ) )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,negated_conjecture,
( ( theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ p @ q ) ) @ q ) ) @ ( or @ ( not @ p ) @ q ) ) )
!= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
thf(11,plain,
( ( theorem @ ( or @ ( not @ ( or @ ( not @ ( or @ p @ q ) ) @ q ) ) @ ( or @ ( not @ p ) @ q ) ) )
!= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(8,axiom,
! [A: $i] :
( ( ifeq @ ( axiom @ A ) @ true @ ( theorem @ A ) @ true )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
thf(26,plain,
! [A: $i] :
( ( ifeq @ ( axiom @ A ) @ true @ ( theorem @ A ) @ true )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(10,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq @ ( theorem @ ( or @ ( not @ A ) @ B ) ) @ true @ ( ifeq @ ( axiom @ ( or @ ( not @ C ) @ A ) ) @ true @ ( theorem @ ( or @ ( not @ C ) @ B ) ) @ true ) @ true )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
thf(30,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq @ ( theorem @ ( or @ ( not @ A ) @ B ) ) @ true @ ( ifeq @ ( axiom @ ( or @ ( not @ C ) @ A ) ) @ true @ ( theorem @ ( or @ ( not @ C ) @ B ) ) @ true ) @ true )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(3424,plain,
$false,
inference(e,[status(thm)],[24,14,20,28,22,18,16,11,26,30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL218-10 : TPTP v8.1.2. Released v7.3.0.
% 0.12/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 18 16:21:17 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.95/0.85 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.21/0.98 % [INFO] Parsing done (126ms).
% 1.21/0.99 % [INFO] Running in sequential loop mode.
% 1.62/1.18 % [INFO] eprover registered as external prover.
% 1.69/1.18 % [INFO] cvc4 registered as external prover.
% 1.69/1.19 % [INFO] Scanning for conjecture ...
% 1.84/1.24 % [INFO] Found a conjecture and 9 axioms. Running axiom selection ...
% 1.84/1.26 % [INFO] Axiom selection finished. Selected 9 axioms (removed 0 axioms).
% 1.84/1.28 % [INFO] Problem is propositional (TPTP CNF).
% 1.84/1.28 % [INFO] Type checking passed.
% 1.84/1.28 % [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 ...
% 30.28/5.47 % External prover 'e' found a proof!
% 30.28/5.47 % [INFO] Killing All external provers ...
% 30.28/5.47 % Time passed: 4965ms (effective reasoning time: 4476ms)
% 30.28/5.47 % 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)>
% 30.28/5.47 % Axioms used in derivation (9): axiom_1_5, ifeq_axiom, axiom_1_4, rule_1, axiom_1_3, rule_3, axiom_1_2, rule_2, axiom_1_6
% 30.28/5.47 % No. of inferences in proof: 21
% 30.28/5.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4965 ms resp. 4476 ms w/o parsing
% 30.30/5.49 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 30.30/5.49 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------