%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NUM647_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:09:25 AM UTC 2026
% Result : Theorem 3.60s 2.39s
% Output : Refutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 14 unt; 0 typ; 1 def)
% Number of atoms : 25 ( 24 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 71 ( 10 ~; 3 |; 0 &; 56 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 22 !; 1 ?; 24 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_decl,type,
x: nat ).
thf(y_decl,type,
y: nat ).
thf(z_decl,type,
z: nat ).
thf(pl_decl,type,
pl: nat > nat > nat ).
thf(sk1_decl,type,
sk1: nat > nat > nat ).
thf(sk1_def,definition,
( sk1
= ( @+[A: nat > nat > nat] :
! [B: nat,C: nat] :
( ( C @ ( B @ pl ) @ ( B @ A ) )
= C ) ) ) ).
thf(3,axiom,
( ( y @ ( x @ pl ) )
= ( z @ ( x @ pl ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
thf(8,plain,
( ( y @ ( x @ pl ) )
= ( z @ ( x @ pl ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,plain,
( ( z @ ( x @ pl ) )
= ( y @ ( x @ pl ) ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(5,axiom,
! [A: nat,B: nat,C: nat] :
( ( B != C )
=> ( ( B @ ( A @ pl ) )
!= ( C @ ( A @ pl ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz8) ).
thf(11,plain,
! [A: nat,B: nat,C: nat] :
( ( B != C )
=> ( ( B @ ( A @ pl ) )
!= ( C @ ( A @ pl ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(12,plain,
! [C: nat,B: nat,A: nat] :
( ( ( B @ ( A @ pl ) )
!= ( C @ ( A @ pl ) ) )
| ( B = C ) ),
inference(cnf,[status(esa)],[11]) ).
thf(13,plain,
! [C: nat,B: nat,A: nat] :
( ( ( B @ ( A @ pl ) )
!= ( C @ ( A @ pl ) ) )
| ( B = C ) ),
inference(lifteq,[status(thm)],[12]) ).
thf(14,plain,
? [A: nat > nat > nat] :
! [B: nat,C: nat] :
( ( C @ ( B @ pl ) @ ( B @ A ) )
= C ),
inference(detectInverse,[status(thm)],[13]) ).
thf(15,plain,
! [B: nat,A: nat] :
( ( B @ ( A @ pl ) @ ( A @ sk1 ) )
= B ),
inference(cnf,[status(esa)],[14]) ).
thf(16,plain,
! [B: nat,A: nat] :
( ( B @ ( A @ pl ) @ ( A @ sk1 ) )
= B ),
inference(lifteq,[status(thm)],[15]) ).
thf(17,plain,
! [B: nat,A: nat] :
( ( ( z @ ( x @ pl ) )
!= ( B @ ( A @ pl ) ) )
| ( ( y @ ( x @ pl ) @ ( A @ sk1 ) )
= B ) ),
inference(paramod_ordered,[status(thm)],[9,16]) ).
thf(18,plain,
( ( y @ ( x @ pl ) @ ( x @ sk1 ) )
= z ),
inference(pattern_uni,[status(thm)],[17:[bind(A,$thf( x )),bind(B,$thf( z ))]]) ).
thf(19,plain,
z = y,
inference(rewrite,[status(thm)],[18,16]) ).
thf(1,conjecture,
y = z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz8a) ).
thf(2,negated_conjecture,
y != z,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
y != z,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
z != y,
inference(lifteq,[status(thm)],[6]) ).
thf(20,plain,
$false,
inference(simplifyReflect,[status(thm)],[19,7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM647_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.09 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.15/0.42 % Computer : n009.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Sat Sep 26 03:34:59 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.86/1.00 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.25/1.17 % [INFO] Parsing done (173ms).
% 1.25/1.19 % [INFO] Running in sequential loop mode.
% 2.00/1.61 % [INFO] eprover registered as external prover.
% 2.00/1.62 % [INFO] Scanning for conjecture ...
% 2.00/1.70 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.19/1.73 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.19/1.75 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.19/1.75 % [INFO] Type checking passed.
% 2.19/1.76 % [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.60/2.38 % [INFO] Killing All external provers ...
% 3.60/2.39 % Time passed: 1819ms (effective reasoning time: 1189ms)
% 3.60/2.39 % 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)>
% 3.60/2.39 % Axioms used in derivation (2): i, satz8
% 3.60/2.39 % No. of inferences in proof: 18
% 3.60/2.39 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1819 ms resp. 1189 ms w/o parsing
% 3.87/2.43 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.87/2.43 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------