%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO291^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 : n005.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:32 AM UTC 2026
% Result : Theorem 4.65s 2.83s
% Output : Refutation 4.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 7 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 38 ( 5 ~; 2 |; 7 &; 21 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 5 ( 0 ^; 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(y_decl,type,
y: $i ).
thf(cQ_decl,type,
cQ: $i > $o ).
thf(x_decl,type,
x: $i ).
thf(f_decl,type,
f: $i > $i ).
thf(cR_decl,type,
cR: $i > $o ).
thf(1,conjecture,
( ! [A: $i > $o] : ( A @ y )
=> ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTEST3) ).
thf(2,negated_conjecture,
~ ( ! [A: $i > $o] : ( A @ y )
=> ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i > $o] : ( A @ y )
=> ( ( cR @ x )
& ( cR @ ( f @ x ) )
& ( cQ @ y ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
! [A: $i > $o] :
( ( A @ y )
& ( ~ ( cR @ x )
| ~ ( cR @ ( f @ x ) )
| ~ ( cQ @ y ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i > $o] : ( A @ y ),
inference(cnfConj,[status(thm)],[4]) ).
thf(14,plain,
$false,
inference(prim_subst,[status(thm)],[5:[bind(A,$thf( ^ [B: $i] : $false ))]]) ).
thf(21,plain,
$false,
inference(simp,[status(thm)],[14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO291^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.11 % 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.10/0.29 % Computer : n005.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8046.5625MB
% 0.10/0.29 % OS : Linux 6.8.0-71-generic
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Tue Sep 29 16:43:16 UTC 2026
% 0.10/0.29 % CPUTime :
% 0.10/0.29 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
% 1.37/1.08 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.80/1.34 % [INFO] Parsing done (253ms).
% 1.80/1.36 % [INFO] Running in sequential loop mode.
% 2.74/1.95 % [INFO] eprover registered as external prover.
% 2.74/1.96 % [INFO] Scanning for conjecture ...
% 3.04/2.08 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 3.04/2.13 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 3.04/2.13 % [INFO] Problem is higher-order (TPTP THF).
% 3.04/2.14 % [INFO] Type checking passed.
% 3.04/2.15 % [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.65/2.82 % [INFO] Killing All external provers ...
% 4.65/2.82 % Time passed: 2347ms (effective reasoning time: 1453ms)
% 4.65/2.82 % 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.65/2.82 % Axioms used in derivation (0):
% 4.65/2.82 % No. of inferences in proof: 7
% 4.65/2.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2347 ms resp. 1453 ms w/o parsing
% 4.65/2.87 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.65/2.87 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------