%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SEV434_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n003.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:48:00 AM UTC 2026
% Result : Theorem 9.87s 3.91s
% Output : Refutation 9.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 29 unt; 0 typ; 4 def)
% Number of atoms : 123 ( 67 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 158 ( 48 ~; 30 |; 2 &; 78 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 1 ^; 26 !; 2 ?; 33 :)
% ( 0 !>; 0 ?*; 0 @-; 4 @+)
% Comments :
%------------------------------------------------------------------------------
thf(f_decl,type,
f: $o > $i ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(sk3_decl,type,
sk3: $i ).
thf(sk4_decl,type,
sk4: $i > $o ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ! [B: $i] :
( ! [C: $i] :
( ( B = C )
| ( A = C ) )
| ( A = B ) ) ) ) ).
thf(sk2_def,definition,
( sk2
= ( @+[A: $i] :
~ ( ! [B: $i] :
( ( A = B )
| ( sk1 = B ) )
| ( sk1 = A ) ) ) ) ).
thf(sk3_def,definition,
( sk3
= ( @+[A: $i] :
~ ( ( sk2 = A )
| ( sk1 = A ) ) ) ) ).
thf(sk4_def,definition,
( sk4
= ( ^ [A: $i] :
@+[B: $o] :
( ( B @ f )
= A ) ) ) ).
thf(3,axiom,
! [A: $i] :
? [B: $o] :
( ( B @ f )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fsurj) ).
thf(13,plain,
! [A: $i] :
? [B: $o] :
( ( B @ f )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(14,plain,
! [A: $i] :
( ( A @ sk4 @ f )
= A ),
inference(cnf,[status(esa)],[13]) ).
thf(19,plain,
! [A: $i] :
( ( A @ sk4 @ f )
= A ),
inference(lifteq,[status(thm)],[14]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i] :
( ( B = C )
| ( A = C )
| ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i] :
( ( B = C )
| ( A = C )
| ( A = B ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $i,B: $i,C: $i] :
( ( B = C )
| ( A = C )
| ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
~ ! [A: $i,B: $i] :
( ! [C: $i] :
( ( B = C )
| ( A = C ) )
| ( A = B ) ),
inference(miniscope,[status(thm)],[4]) ).
thf(6,plain,
( ( sk2 != sk3 )
& ( sk1 != sk3 )
& ( sk1 != sk2 ) ),
inference(cnf,[status(esa)],[5]) ).
thf(8,plain,
sk1 != sk3,
inference(cnfConj,[status(thm)],[6]) ).
thf(17,plain,
sk3 != sk1,
inference(lifteq,[status(thm)],[8]) ).
thf(28,plain,
! [A: $i] :
( ( A != sk3 )
| ( ( A @ sk4 @ f )
!= sk1 ) ),
inference(paramod_ordered,[status(thm)],[19,17]) ).
thf(29,plain,
( ( sk3 @ sk4 @ f )
!= sk1 ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( sk3 ))]]) ).
thf(74,plain,
! [A: $i] :
( ( A != sk1 )
| ( ( A @ sk4 @ f )
!= ( sk3 @ sk4 @ f ) ) ),
inference(paramod_ordered,[status(thm)],[19,29]) ).
thf(75,plain,
( ( sk1 @ sk4 @ f )
!= ( sk3 @ sk4 @ f ) ),
inference(pattern_uni,[status(thm)],[74:[bind(A,$thf( sk1 ))]]) ).
thf(759,plain,
( ( sk1 @ sk4 )
!= ( sk3 @ sk4 ) ),
inference(simp,[status(thm)],[75]) ).
thf(7,plain,
sk1 != sk2,
inference(cnfConj,[status(thm)],[6]) ).
thf(16,plain,
sk2 != sk1,
inference(lifteq,[status(thm)],[7]) ).
thf(22,plain,
! [A: $i] :
( ( A != sk2 )
| ( ( A @ sk4 @ f )
!= sk1 ) ),
inference(paramod_ordered,[status(thm)],[19,16]) ).
thf(23,plain,
( ( sk2 @ sk4 @ f )
!= sk1 ),
inference(pattern_uni,[status(thm)],[22:[bind(A,$thf( sk2 ))]]) ).
thf(52,plain,
! [A: $i] :
( ( A != sk1 )
| ( ( A @ sk4 @ f )
!= ( sk2 @ sk4 @ f ) ) ),
inference(paramod_ordered,[status(thm)],[19,23]) ).
thf(53,plain,
( ( sk1 @ sk4 @ f )
!= ( sk2 @ sk4 @ f ) ),
inference(pattern_uni,[status(thm)],[52:[bind(A,$thf( sk1 ))]]) ).
thf(125,plain,
( ( sk1 @ sk4 )
!= ( sk2 @ sk4 ) ),
inference(simp,[status(thm)],[53]) ).
thf(144,plain,
( ( sk2 @ sk4 )
| ( sk1 @ sk4 ) ),
inference(bool_ext,[status(thm)],[125]) ).
thf(200,plain,
! [A: $i] :
( ( ( sk1 @ sk4 )
!= ( A @ sk4 ) )
| ( ( $true @ f )
= A )
| ( sk2 @ sk4 ) ),
inference(paramod_ordered,[status(thm)],[144,19]) ).
thf(201,plain,
( ( ( $true @ f )
= sk1 )
| ( sk2 @ sk4 ) ),
inference(pattern_uni,[status(thm)],[200:[bind(A,$thf( sk1 ))]]) ).
thf(379,plain,
( ( ( $true @ f )
!= ( sk3 @ sk4 @ f ) )
| ( sk1 != sk1 )
| ( sk2 @ sk4 ) ),
inference(paramod_ordered,[status(thm)],[201,29]) ).
thf(380,plain,
( ( ( $true @ f )
!= ( sk3 @ sk4 @ f ) )
| ( sk2 @ sk4 ) ),
inference(simp,[status(thm)],[379]) ).
thf(530,plain,
( ~ ( sk3 @ sk4 )
| ( sk2 @ sk4 ) ),
inference(simp,[status(thm)],[380]) ).
thf(9,plain,
sk2 != sk3,
inference(cnfConj,[status(thm)],[6]) ).
thf(18,plain,
sk3 != sk2,
inference(lifteq,[status(thm)],[9]) ).
thf(38,plain,
! [A: $i] :
( ( A != sk3 )
| ( ( A @ sk4 @ f )
!= sk2 ) ),
inference(paramod_ordered,[status(thm)],[19,18]) ).
thf(39,plain,
( ( sk3 @ sk4 @ f )
!= sk2 ),
inference(pattern_uni,[status(thm)],[38:[bind(A,$thf( sk3 ))]]) ).
thf(96,plain,
! [A: $i] :
( ( A != sk2 )
| ( ( A @ sk4 @ f )
!= ( sk3 @ sk4 @ f ) ) ),
inference(paramod_ordered,[status(thm)],[19,39]) ).
thf(97,plain,
( ( sk2 @ sk4 @ f )
!= ( sk3 @ sk4 @ f ) ),
inference(pattern_uni,[status(thm)],[96:[bind(A,$thf( sk2 ))]]) ).
thf(1791,plain,
( ( sk2 @ sk4 )
!= ( sk3 @ sk4 ) ),
inference(simp,[status(thm)],[97]) ).
thf(1915,plain,
( ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) )
| ~ ( sk3 @ sk4 )
| ~ ( sk3 @ sk4 ) ),
inference(paramod_ordered,[status(thm)],[530,1791]) ).
thf(1916,plain,
( ( ( sk2 @ sk4 )
!= ( sk2 @ sk4 ) )
| ~ ( sk3 @ sk4 ) ),
inference(simp,[status(thm)],[1915]) ).
thf(1917,plain,
~ ( sk3 @ sk4 ),
inference(pattern_uni,[status(thm)],[1916:[]]) ).
thf(1980,plain,
sk1 @ sk4,
inference(rewrite,[status(thm)],[759,1917]) ).
thf(1975,plain,
sk2 @ sk4,
inference(rewrite,[status(thm)],[1791,1917]) ).
thf(2012,plain,
~ ( sk1 @ sk4 ),
inference(rewrite,[status(thm)],[125,1975]) ).
thf(2066,plain,
$false,
inference(rewrite,[status(thm)],[1980,2012]) ).
thf(2067,plain,
$false,
inference(simp,[status(thm)],[2066]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV434_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.12/0.39 % Computer : n003.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sat Sep 26 11:06:39 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.87/0.99 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.27/1.17 % [INFO] Parsing done (179ms).
% 1.27/1.19 % [INFO] Running in sequential loop mode.
% 2.02/1.60 % [INFO] eprover registered as external prover.
% 2.02/1.61 % [INFO] Scanning for conjecture ...
% 2.19/1.70 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.19/1.74 % [INFO] Axiom selection finished. Selected 1 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.28/2.29 % [INFO] GaveUp with current strategy, trying again with another strategy ...
% 9.87/3.90 % [INFO] Killing All external provers ...
% 9.87/3.90 % Time passed: 3359ms (effective reasoning time: 2706ms)
% 9.87/3.90 % Solved by strategy<name(funcspec),share(0.5),primSubst(2),sos(false),unifierCount(10),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(true), domConstr(0),specialInstances(-1),restrictUniAttempts(false),termOrdering(none)>
% 9.87/3.91 % Axioms used in derivation (1): fsurj
% 9.87/3.91 % No. of inferences in proof: 44
% 9.87/3.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3359 ms resp. 2706 ms w/o parsing
% 9.87/3.96 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.87/3.96 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------