TSTP Solution File: LCL265-3 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : LCL265-3 : TPTP v8.2.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n010.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 : Tue May 21 00:05:28 EDT 2024
% Result : Unsatisfiable 3.64s 2.24s
% Output : Refutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 19
% Syntax : Number of formulae : 31 ( 19 unt; 8 typ; 0 def)
% Number of atoms : 29 ( 6 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 156 ( 8 ~; 6 |; 0 &; 142 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 40 !; 0 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(theorem_type,type,
theorem: $i > $o ).
thf(equivalent_type,type,
equivalent: $i > $i > $i ).
thf(p_type,type,
p: $i ).
thf(not_type,type,
not: $i > $i ).
thf(axiom_type,type,
axiom: $i > $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(or_type,type,
or: $i > $i > $i ).
thf(and_type,type,
and: $i > $i > $i ).
thf(10,axiom,
! [B: $i,A: $i] :
( ( and @ A @ B )
= ( not @ ( or @ ( not @ A ) @ ( not @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
thf(25,plain,
! [B: $i,A: $i] :
( ( and @ A @ B )
= ( not @ ( or @ ( not @ A ) @ ( not @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(2,axiom,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
thf(14,plain,
! [A: $i] : ( axiom @ ( implies @ ( or @ A @ A ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,axiom,
! [A: $i] :
( ( theorem @ A )
| ~ ( axiom @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
thf(21,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(17,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(11,axiom,
! [B: $i,A: $i] :
( ( equivalent @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
thf(27,plain,
! [B: $i,A: $i] :
( ( equivalent @ A @ B )
= ( and @ ( implies @ A @ B ) @ ( implies @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(1,negated_conjecture,
~ ( theorem @ ( equivalent @ p @ ( not @ ( not @ p ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(12,plain,
~ ( theorem @ ( equivalent @ p @ ( not @ ( not @ p ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
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(18,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(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(16,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(23,plain,
! [B: $i,A: $i] :
( ( theorem @ A )
| ~ ( theorem @ ( implies @ B @ A ) )
| ~ ( theorem @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(7,axiom,
! [B: $i,A: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
thf(19,plain,
! [B: $i,A: $i] :
( ( implies @ A @ B )
= ( or @ ( not @ A ) @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(3,axiom,
! [B: $i,A: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
thf(15,plain,
! [B: $i,A: $i] : ( axiom @ ( implies @ A @ ( or @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(35,plain,
$false,
inference(e,[status(thm)],[25,14,21,17,27,12,18,16,23,19,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LCL265-3 : TPTP v8.2.0. Released v2.3.0.
% 0.09/0.13 % Command : run_Leo-III %s %d
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 01:30:09 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.98/0.96 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.29/1.12 % [INFO] Parsing done (154ms).
% 1.29/1.13 % [INFO] Running in sequential loop mode.
% 2.03/1.50 % [INFO] eprover registered as external prover.
% 2.03/1.50 % [INFO] cvc4 registered as external prover.
% 2.03/1.51 % [INFO] Scanning for conjecture ...
% 2.12/1.59 % [INFO] Found a conjecture (or negated_conjecture) and 10 axioms. Running axiom selection ...
% 2.24/1.62 % [INFO] Axiom selection finished. Selected 10 axioms (removed 0 axioms).
% 2.24/1.65 % [INFO] Problem is propositional (TPTP CNF).
% 2.24/1.65 % [INFO] Type checking passed.
% 2.24/1.66 % [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 ...
% 3.64/2.24 % External prover 'e' found a proof!
% 3.64/2.24 % [INFO] Killing All external provers ...
% 3.64/2.24 % Time passed: 1757ms (effective reasoning time: 1104ms)
% 3.64/2.24 % Axioms used in derivation (10): axiom_1_5, equivalent_defn, and_defn, axiom_1_4, rule_1, axiom_1_3, implies_definition, axiom_1_2, rule_2, axiom_1_6
% 3.64/2.24 % No. of inferences in proof: 23
% 3.64/2.24 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1757 ms resp. 1104 ms w/o parsing
% 3.64/2.27 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.64/2.27 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------