TSTP Solution File: LCL230-3 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL230-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n008.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:52 EDT 2023
% Result : Unsatisfiable 13.72s 3.26s
% Output : Refutation 13.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 17
% Syntax : Number of formulae : 27 ( 15 unt; 8 typ; 0 def)
% Number of atoms : 25 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 142 ( 8 ~; 6 |; 0 &; 128 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 ^; 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_type,type,
theorem: $i > $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(or_type,type,
or: $i > $i > $i ).
thf(p_type,type,
p: $i ).
thf(q_type,type,
q: $i ).
thf(r_type,type,
r: $i ).
thf(axiom_type,type,
axiom: $i > $o ).
thf(not_type,type,
not: $i > $i ).
thf(1,negated_conjecture,
~ ( theorem @ ( implies @ ( implies @ ( or @ p @ q ) @ ( or @ p @ r ) ) @ ( or @ p @ ( implies @ q @ r ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(10,plain,
~ ( theorem @ ( implies @ ( implies @ ( or @ p @ q ) @ ( or @ p @ r ) ) @ ( or @ p @ ( implies @ q @ r ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,axiom,
! [B: $i,A: $i] : ( axiom @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
thf(14,plain,
! [B: $i,A: $i] : ( axiom @ ( implies @ ( or @ A @ B ) @ ( or @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(9,axiom,
! [B: $i,A: $i] :
( ( theorem @ A )
| ~ ( theorem @ ( implies @ B @ A ) )
| ~ ( theorem @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
thf(21,plain,
! [B: $i,A: $i] :
( ( theorem @ A )
| ~ ( theorem @ ( implies @ B @ A ) )
| ~ ( theorem @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(3,axiom,
! [B: $i,A: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
thf(13,plain,
! [B: $i,A: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,axiom,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
thf(12,plain,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] : ( axiom @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( or @ C @ A ) @ ( or @ C @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] : ( axiom @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( or @ C @ A ) @ ( or @ C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(8,axiom,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
thf(19,plain,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] : ( axiom @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
thf(15,plain,
! [C: $i,B: $i,A: $i] : ( axiom @ ( implies @ ( or @ A @ ( or @ B @ C ) ) @ ( or @ B @ ( or @ A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1001,plain,
$false,
inference(e,[status(thm)],[10,14,21,13,17,12,16,19,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL230-3 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.14 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n008.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 15:52:55 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.90/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.23/0.93 % [INFO] Parsing done (106ms).
% 1.23/0.94 % [INFO] Running in sequential loop mode.
% 1.59/1.13 % [INFO] eprover registered as external prover.
% 1.59/1.13 % [INFO] cvc4 registered as external prover.
% 1.59/1.14 % [INFO] Scanning for conjecture ...
% 1.68/1.19 % [INFO] Found a conjecture and 8 axioms. Running axiom selection ...
% 1.68/1.21 % [INFO] Axiom selection finished. Selected 8 axioms (removed 0 axioms).
% 1.68/1.22 % [INFO] Problem is propositional (TPTP CNF).
% 1.68/1.22 % [INFO] Type checking passed.
% 1.68/1.22 % [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 ...
% 13.72/3.25 % External prover 'e' found a proof!
% 13.72/3.25 % [INFO] Killing All external provers ...
% 13.72/3.25 % Time passed: 2743ms (effective reasoning time: 2309ms)
% 13.72/3.25 % 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)>
% 13.72/3.25 % Axioms used in derivation (8): axiom_1_5, axiom_1_4, rule_1, axiom_1_3, implies_definition, axiom_1_2, rule_2, axiom_1_6
% 13.72/3.25 % No. of inferences in proof: 19
% 13.72/3.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2743 ms resp. 2309 ms w/o parsing
% 13.72/3.27 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.72/3.27 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------