%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN361^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 : n002.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:41:31 AM UTC 2026
% Result : Theorem 2.47s 1.24s
% Output : Refutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 53 ( 8 ~; 0 |; 6 &; 30 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 21 ( 0 ^; 12 !; 9 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(cS_decl,type,
cS: $i > $o ).
thf(cQ_decl,type,
cQ: $i > $i > $o ).
thf(cP_decl,type,
cP: $i > $i > $o ).
thf(1,conjecture,
( ( ? [A: $i] :
! [B: $i] : ( cP @ B @ A )
& ! [A: $i] :
( ( cS @ A )
=> ? [B: $i] : ( cQ @ B @ A ) )
& ! [A: $i,B: $i] :
( ( cP @ A @ B )
=> ~ ( cQ @ A @ B ) ) )
=> ? [A: $i] :
~ ( cS @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2112) ).
thf(2,negated_conjecture,
~ ( ( ? [A: $i] :
! [B: $i] : ( cP @ B @ A )
& ! [A: $i] :
( ( cS @ A )
=> ? [B: $i] : ( cQ @ B @ A ) )
& ! [A: $i,B: $i] :
( ( cP @ A @ B )
=> ~ ( cQ @ A @ B ) ) )
=> ? [A: $i] :
~ ( cS @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ? [A: $i] :
! [B: $i] : ( cP @ B @ A )
& ! [A: $i] :
( ( cS @ A )
=> ? [B: $i] : ( cQ @ B @ A ) )
& ! [A: $i,B: $i] :
( ( cP @ A @ B )
=> ~ ( cQ @ A @ B ) ) )
=> ? [A: $i] :
~ ( cS @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(22,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN361^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % 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 : n002.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:17:52 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.69/0.52 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.89/0.62 % [INFO] Parsing done (100ms).
% 0.89/0.63 % [INFO] Running in sequential loop mode.
% 1.31/0.83 % [INFO] eprover registered as external prover.
% 1.31/0.84 % [INFO] Scanning for conjecture ...
% 1.31/0.88 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.56/0.90 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.56/0.90 % [INFO] Problem is higher-order (TPTP THF).
% 1.56/0.90 % [INFO] Type checking passed.
% 1.56/0.91 % [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 ...
% 2.47/1.23 % External prover 'e' found a proof!
% 2.47/1.23 % [INFO] Killing All external provers ...
% 2.47/1.23 % Time passed: 942ms (effective reasoning time: 600ms)
% 2.47/1.23 % 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)>
% 2.47/1.23 % Axioms used in derivation (0):
% 2.47/1.23 % No. of inferences in proof: 4
% 2.47/1.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 942 ms resp. 600 ms w/o parsing
% 2.47/1.25 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.47/1.25 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------