%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO040_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 : n015.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 09:43:40 AM UTC 2026
% Result : Theorem 4.90s 2.73s
% Output : Refutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 184 ( 18 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 158 ( 35 ~; 33 |; 0 &; 90 @)
% ( 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 : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(f_decl,type,
f: $o > $o ).
thf(h_decl,type,
h: $o > $i ).
thf(x_decl,type,
x: $o ).
thf(1,conjecture,
( ( x @ f @ f @ f @ h )
= ( x @ f @ h ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',2) ).
thf(2,negated_conjecture,
( ( x @ f @ f @ f @ h )
!= ( x @ f @ h ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( x @ f @ f @ f @ h )
!= ( x @ f @ h ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( x @ f @ f @ f @ h )
!= ( x @ f @ h ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ( x @ f @ f @ f )
!= ( x @ f ) ),
inference(simp,[status(thm)],[4]) ).
thf(6,plain,
( ( x @ f @ f )
!= x ),
inference(simp,[status(thm)],[5]) ).
thf(10,plain,
( x
| ( x @ f @ f ) ),
inference(bool_ext,[status(thm)],[6]) ).
thf(7,plain,
( ~ ( x @ f )
| ~ ( x @ f @ f @ f ) ),
inference(bool_ext,[status(thm)],[5]) ).
thf(29,plain,
( ( ( x @ f @ f )
!= ( x @ f @ f ) )
| ~ ( x @ f )
| ~ ( $true @ f )
| x ),
inference(paramod_ordered,[status(thm)],[10,7]) ).
thf(30,plain,
( ~ ( x @ f )
| ~ ( $true @ f )
| x ),
inference(pattern_uni,[status(thm)],[29:[]]) ).
thf(59,plain,
( ( ( x @ f @ f )
!= ( $true @ f ) )
| ~ ( x @ f )
| ~ $true
| x
| x ),
inference(paramod_ordered,[status(thm)],[10,30]) ).
thf(60,plain,
( ( ( x @ f @ f )
!= ( $true @ f ) )
| ~ ( x @ f )
| x ),
inference(simp,[status(thm)],[59]) ).
thf(64,plain,
( ~ ( x @ f )
| ~ ( x @ f )
| x ),
inference(simp,[status(thm)],[60]) ).
thf(68,plain,
( ~ ( x @ f )
| x ),
inference(simp,[status(thm)],[64]) ).
thf(128,plain,
( ( ( x @ f @ f )
!= ( x @ f ) )
| ~ $true
| x
| x ),
inference(paramod_ordered,[status(thm)],[10,68]) ).
thf(129,plain,
( ( ( x @ f @ f )
!= ( x @ f ) )
| x ),
inference(simp,[status(thm)],[128]) ).
thf(132,plain,
( ( ( x @ f )
!= x )
| x ),
inference(simp,[status(thm)],[129]) ).
thf(135,plain,
( x
| ( x @ f )
| x ),
inference(bool_ext,[status(thm)],[132]) ).
thf(139,plain,
( ( x @ f )
| x ),
inference(simp,[status(thm)],[135]) ).
thf(175,plain,
( ( ( x @ f )
!= ( x @ f ) )
| ~ $true
| x
| x ),
inference(paramod_ordered,[status(thm)],[139,68]) ).
thf(176,plain,
( ( ( x @ f )
!= ( x @ f ) )
| x ),
inference(simp,[status(thm)],[175]) ).
thf(177,plain,
x,
inference(pattern_uni,[status(thm)],[176:[]]) ).
thf(192,plain,
~ ( $true @ f @ f ),
inference(rewrite,[status(thm)],[6,177]) ).
thf(191,plain,
( ( $true @ f @ f @ f )
!= ( $true @ f ) ),
inference(rewrite,[status(thm)],[5,177]) ).
thf(204,plain,
( ( $false @ f )
!= ( $true @ f ) ),
inference(rewrite,[status(thm)],[191,192]) ).
thf(207,plain,
( ( $true @ f )
| ( $false @ f ) ),
inference(bool_ext,[status(thm)],[204]) ).
thf(225,plain,
( ( ( $true @ f @ f )
!= ( $false @ f ) )
| ~ $true
| ( $true @ f ) ),
inference(paramod_ordered,[status(thm)],[207,192]) ).
thf(226,plain,
( ( ( $true @ f @ f )
!= ( $false @ f ) )
| ( $true @ f ) ),
inference(simp,[status(thm)],[225]) ).
thf(234,plain,
( ( $true @ f )
| ( $true @ f ) ),
inference(simp,[status(thm)],[226]) ).
thf(240,plain,
$true @ f,
inference(simp,[status(thm)],[234]) ).
thf(247,plain,
~ ( $true @ f ),
inference(rewrite,[status(thm)],[192,240]) ).
thf(253,plain,
~ $true,
inference(rewrite,[status(thm)],[247,240]) ).
thf(254,plain,
$false,
inference(simp,[status(thm)],[253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO040_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08 % 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.14/0.40 % Computer : n015.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Sat Sep 26 19:00:15 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.14/0.41 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.83/1.00 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/1.16 % [INFO] Parsing done (156ms).
% 1.17/1.17 % [INFO] Running in sequential loop mode.
% 1.68/1.56 % [INFO] eprover registered as external prover.
% 1.68/1.57 % [INFO] Scanning for conjecture ...
% 1.88/1.66 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.88/1.69 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.88/1.69 % [INFO] Problem is typed first-order (TPTP TFF).
% 1.88/1.69 % [INFO] Type checking passed.
% 2.02/1.70 % [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 ...
% 4.90/2.72 % [INFO] Killing All external provers ...
% 4.90/2.73 % Time passed: 2170ms (effective reasoning time: 1550ms)
% 4.90/2.73 % 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)>
% 4.90/2.73 % Axioms used in derivation (0):
% 4.90/2.73 % No. of inferences in proof: 33
% 4.90/2.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2170 ms resp. 1550 ms w/o parsing
% 4.90/2.77 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.90/2.77 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------