TSTP Solution File: LDA002-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LDA002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n022.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:34:19 EDT 2023
% Result : Unsatisfiable 2.94s 1.69s
% Output : Refutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 24
% Syntax : Number of formulae : 37 ( 25 unt; 12 typ; 0 def)
% Number of atoms : 25 ( 24 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 74 ( 2 ~; 0 |; 0 &; 72 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 12 con; 0-2 aty)
% Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_type,type,
f: $i > $i > $i ).
thf(a_type,type,
a: $i ).
thf(v_type,type,
v: $i ).
thf(b_type,type,
b: $i ).
thf(n2_type,type,
n2: $i ).
thf(n1_type,type,
n1: $i ).
thf(n3_type,type,
n3: $i ).
thf(u_type,type,
u: $i ).
thf(u1_type,type,
u1: $i ).
thf(u2_type,type,
u2: $i ).
thf(u3_type,type,
u3: $i ).
thf(uu_type,type,
uu: $i ).
thf(6,axiom,
( u1
= ( f @ u @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
thf(24,plain,
( u1
= ( f @ u @ n1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
( n3
= ( f @ n2 @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
thf(20,plain,
( n3
= ( f @ n2 @ n1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(8,axiom,
( u3
= ( f @ u @ n3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
thf(28,plain,
( u3
= ( f @ u @ n3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(1,negated_conjecture,
( ( f @ a @ v )
!= ( f @ b @ v ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).
thf(13,plain,
( ( f @ a @ v )
!= ( f @ b @ v ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(5,axiom,
( u
= ( f @ n2 @ n2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
thf(22,plain,
( u
= ( f @ n2 @ n2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(3,axiom,
( n2
= ( f @ n1 @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
thf(18,plain,
( n2
= ( f @ n1 @ n1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( f @ A @ ( f @ B @ C ) )
= ( f @ ( f @ A @ B ) @ ( f @ A @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] :
( ( f @ A @ ( f @ B @ C ) )
= ( f @ ( f @ A @ B ) @ ( f @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,axiom,
( u2
= ( f @ u @ n2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
thf(26,plain,
( u2
= ( f @ u @ n2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(10,axiom,
( a
= ( f @ ( f @ n3 @ n2 ) @ u2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
thf(32,plain,
( a
= ( f @ ( f @ n3 @ n2 ) @ u2 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(11,axiom,
( b
= ( f @ u1 @ u3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
thf(34,plain,
( b
= ( f @ u1 @ u3 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(12,axiom,
( v
= ( f @ uu @ uu ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
thf(36,plain,
( v
= ( f @ uu @ uu ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(9,axiom,
( uu
= ( f @ u @ u ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
thf(30,plain,
( uu
= ( f @ u @ u ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(44,plain,
$false,
inference(e,[status(thm)],[24,20,28,13,22,18,16,26,32,34,36,30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LDA002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.16 % Command : run_Leo-III %s %d
% 0.17/0.38 % Computer : n022.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Thu May 18 20:18:03 EDT 2023
% 0.17/0.38 % CPUTime :
% 1.01/0.90 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.29/1.02 % [INFO] Parsing done (121ms).
% 1.29/1.03 % [INFO] Running in sequential loop mode.
% 1.66/1.23 % [INFO] eprover registered as external prover.
% 1.66/1.23 % [INFO] cvc4 registered as external prover.
% 1.76/1.24 % [INFO] Scanning for conjecture ...
% 1.76/1.29 % [INFO] Found a conjecture and 11 axioms. Running axiom selection ...
% 1.76/1.30 % [INFO] Axiom selection finished. Selected 11 axioms (removed 0 axioms).
% 1.76/1.32 % [INFO] Problem is propositional (TPTP CNF).
% 1.76/1.32 % [INFO] Type checking passed.
% 1.76/1.32 % [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.64/1.68 % External prover 'e' found a proof!
% 2.64/1.68 % [INFO] Killing All external provers ...
% 2.64/1.68 % Time passed: 1137ms (effective reasoning time: 645ms)
% 2.64/1.68 % 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.64/1.68 % Axioms used in derivation (11): clause_5, clause_2, clause_8, clause_9, clause_4, clause_6, a1, clause_7, clause_10, clause_11, clause_3
% 2.64/1.68 % No. of inferences in proof: 25
% 2.94/1.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1137 ms resp. 645 ms w/o parsing
% 2.94/1.72 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.94/1.72 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------