TSTP Solution File: LCL365-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL365-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n018.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:30:12 EDT 2023
% Result : Unsatisfiable 19.62s 4.36s
% Output : Refutation 19.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of formulae : 18 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 15 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 98 ( 6 ~; 4 |; 0 &; 88 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(is_a_theorem_type,type,
is_a_theorem: $i > $o ).
thf(implies_type,type,
implies: $i > $i > $i ).
thf(x_type,type,
x: $i ).
thf(y_type,type,
y: $i ).
thf(z_type,type,
z: $i ).
thf(u_type,type,
u: $i ).
thf(not_type,type,
not: $i > $i ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
thf(10,plain,
! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ B ) @ ( implies @ ( implies @ B @ C ) @ ( implies @ A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,negated_conjecture,
~ ( is_a_theorem @ ( implies @ ( implies @ ( implies @ x @ ( implies @ ( implies @ y @ z ) @ z ) ) @ u ) @ ( implies @ ( implies @ ( not @ z ) @ y ) @ u ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_14) ).
thf(6,plain,
~ ( is_a_theorem @ ( implies @ ( implies @ ( implies @ x @ ( implies @ ( implies @ y @ z ) @ z ) ) @ u ) @ ( implies @ ( implies @ ( not @ z ) @ y ) @ u ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(5,axiom,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
thf(12,plain,
! [B: $i,A: $i] : ( is_a_theorem @ ( implies @ A @ ( implies @ ( not @ A ) @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(4,axiom,
! [A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ A ) @ A ) @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
thf(11,plain,
! [A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( not @ A ) @ A ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( implies @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
thf(8,plain,
! [B: $i,A: $i] :
( ~ ( is_a_theorem @ ( implies @ A @ B ) )
| ~ ( is_a_theorem @ A )
| ( is_a_theorem @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(666,plain,
$false,
inference(e,[status(thm)],[10,6,12,11,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL365-1 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n018.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu May 18 16:14:28 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.89/0.81 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/0.92 % [INFO] Parsing done (106ms).
% 1.22/0.92 % [INFO] Running in sequential loop mode.
% 1.52/1.13 % [INFO] eprover registered as external prover.
% 1.52/1.14 % [INFO] cvc4 registered as external prover.
% 1.52/1.14 % [INFO] Scanning for conjecture ...
% 1.80/1.19 % [INFO] Found a conjecture and 4 axioms. Running axiom selection ...
% 1.80/1.21 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 1.80/1.22 % [INFO] Problem is propositional (TPTP CNF).
% 1.80/1.22 % [INFO] Type checking passed.
% 1.80/1.23 % [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 ...
% 19.62/4.35 % External prover 'e' found a proof!
% 19.62/4.35 % [INFO] Killing All external provers ...
% 19.62/4.35 % Time passed: 3833ms (effective reasoning time: 3426ms)
% 19.62/4.35 % 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)>
% 19.62/4.35 % Axioms used in derivation (4): cn_1, cn_3, cn_2, condensed_detachment
% 19.62/4.35 % No. of inferences in proof: 11
% 19.62/4.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 3833 ms resp. 3426 ms w/o parsing
% 19.62/4.38 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 19.62/4.38 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------