%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO261^5 : TPTP v9.3.1. Released v4.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 : n019.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 : Wed Sep 30 08:45:29 AM UTC 2026
% Result : Theorem 5.18s 2.72s
% Output : Refutation 5.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 7 unt; 0 typ; 1 def)
% Number of atoms : 51 ( 17 equ; 4 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 153 ( 23 ~; 19 |; 13 &; 85 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 15 ( 1 ^; 13 !; 0 ?; 15 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(n_decl,type,
n: $i ).
thf(cP_decl,type,
cP: $i > $o ).
thf(c1_plus_decl,type,
c1_plus: $i > $i ).
thf(cO_decl,type,
cO: $i ).
thf(sk1_decl,type,
sk1: ( $i > $o ) > $i ).
thf(sk1_def,definition,
( sk1
= ( ^ [A: $i > $o] :
@+[B: $i] :
~ ( ( A @ B )
=> ( A @ ( c1_plus @ B ) ) ) ) ) ).
thf(1,conjecture,
( ( ! [A: $i > $o] :
( ( ( A @ cO )
& ! [B: $i] :
( ( A @ B )
=> ( A @ ( c1_plus @ B ) ) ) )
=> ( A @ n ) )
& ( cP @ cO )
& ! [A: $i] :
( ( cP @ A )
=> ( cP @ ( c1_plus @ A ) ) ) )
=> ( cP @ n ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE_FENG_SV_I1) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i > $o] :
( ( ( A @ cO )
& ! [B: $i] :
( ( A @ B )
=> ( A @ ( c1_plus @ B ) ) ) )
=> ( A @ n ) )
& ( cP @ cO )
& ! [A: $i] :
( ( cP @ A )
=> ( cP @ ( c1_plus @ A ) ) ) )
=> ( cP @ n ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: $i > $o] :
( ( ( A @ cO )
& ! [B: $i] :
( ( A @ B )
=> ( A @ ( c1_plus @ B ) ) ) )
=> ( A @ n ) )
& ( cP @ cO )
& ! [A: $i] :
( ( cP @ A )
=> ( cP @ ( c1_plus @ A ) ) ) )
=> ( cP @ n ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [B: $i,A: $i > $o] :
( ( ~ ( A @ cO )
| ( A @ ( sk1 @ A ) )
| ( A @ n ) )
& ( ~ ( A @ cO )
| ~ ( A @ ( c1_plus @ ( sk1 @ A ) ) )
| ( A @ n ) )
& ( cP @ cO )
& ( ~ ( cP @ B )
| ( cP @ ( c1_plus @ B ) ) )
& ~ ( cP @ n ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i > $o] :
( ~ ( A @ cO )
| ~ ( A @ ( c1_plus @ ( sk1 @ A ) ) )
| ( A @ n ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
! [A: $i > $o] :
( ~ ( A @ cO )
| ( A @ ( sk1 @ A ) )
| ( A @ n ) ),
inference(cnfConj,[status(thm)],[4]) ).
thf(11,plain,
( ( cO != cO )
| ( cO
= ( sk1 @ ( (=) @ $i @ cO ) ) )
| ( cO = n ) ),
inference(replace_leibeq,[status(thm)],[6:[bind(A,$thf( (=) @ $i @ cO ))]]) ).
thf(15,plain,
( ( cO != cO )
| ( ( sk1 @ ( (=) @ $i @ cO ) )
= cO )
| ( cO = n ) ),
inference(lifteq,[status(thm)],[11]) ).
thf(16,plain,
( ( ( sk1 @ ( (=) @ $i @ cO ) )
= cO )
| ( cO = n ) ),
inference(simp,[status(thm)],[15]) ).
thf(7,plain,
cP @ cO,
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
~ ( cP @ n ),
inference(cnfConj,[status(thm)],[4]) ).
thf(17,plain,
( ~ $true
| ( ( cP @ cO )
!= ( cP @ n ) ) ),
inference(paramod_ordered,[status(thm)],[7,8]) ).
thf(18,plain,
( ( cP @ cO )
!= ( cP @ n ) ),
inference(simp,[status(thm)],[17]) ).
thf(19,plain,
cO != n,
inference(simp,[status(thm)],[18]) ).
thf(20,plain,
( ( sk1 @ ( (=) @ $i @ cO ) )
= cO ),
inference(simplifyReflect,[status(thm)],[16,19]) ).
thf(32,plain,
( ~ ( cP @ cO )
| ~ ( cP @ ( c1_plus @ ( sk1 @ cP ) ) )
| ( cP @ n ) ),
inference(prim_subst,[status(thm)],[5:[bind(A,$thf( cP ))]]) ).
thf(72,plain,
( ~ $true
| ~ ( cP @ ( c1_plus @ ( sk1 @ cP ) ) )
| $false ),
inference(rewrite,[status(thm)],[32,7,8]) ).
thf(73,plain,
~ ( cP @ ( c1_plus @ ( sk1 @ cP ) ) ),
inference(simp,[status(thm)],[72]) ).
thf(186,plain,
$false,
inference(e,[status(thm)],[5,20,6,73,7,3,8,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO261^5 : TPTP v9.3.1. Released v4.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.09/0.21 % Computer : n019.cluster.edu
% 0.09/0.21 % Model : x86_64 x86_64
% 0.09/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.21 % Memory : 8046.5625MB
% 0.09/0.21 % OS : Linux 6.8.0-71-generic
% 0.09/0.21 % CPULimit : 300
% 0.09/0.21 % WCLimit : 300
% 0.09/0.21 % DateTime : Tue Sep 29 16:42:03 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 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.88/0.79 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/0.98 % [INFO] Parsing done (179ms).
% 1.22/0.99 % [INFO] Running in sequential loop mode.
% 2.02/1.40 % [INFO] eprover registered as external prover.
% 2.02/1.41 % [INFO] Scanning for conjecture ...
% 2.20/1.50 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.20/1.54 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.20/1.54 % [INFO] Problem is higher-order (TPTP THF).
% 2.20/1.55 % [INFO] Type checking passed.
% 2.20/1.56 % [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 ...
% 5.18/2.72 % External prover 'e' found a proof!
% 5.18/2.72 % [INFO] Killing All external provers ...
% 5.18/2.72 % Time passed: 2359ms (effective reasoning time: 1722ms)
% 5.18/2.72 % 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)>
% 5.18/2.72 % Axioms used in derivation (0):
% 5.18/2.72 % No. of inferences in proof: 19
% 5.18/2.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2359 ms resp. 1722 ms w/o parsing
% 5.18/2.77 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.18/2.77 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------