%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO382^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 : n009.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:41 AM UTC 2026
% Result : Theorem 2.62s 1.71s
% Output : Refutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 72 ( 10 ~; 0 |; 8 &; 40 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 16 !; 12 ?; 28 :)
% 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 ) )
=> ( ( ? [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',cTHM407) ).
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 ) )
=> ( ( ? [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,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
$false,
inference(simp,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO382^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.10/0.20 % Computer : n009.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 16:50:00 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/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.90/0.78 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.24/0.97 % [INFO] Parsing done (190ms).
% 1.24/0.99 % [INFO] Running in sequential loop mode.
% 2.04/1.40 % [INFO] eprover registered as external prover.
% 2.04/1.41 % [INFO] Scanning for conjecture ...
% 2.24/1.50 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.24/1.54 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.24/1.54 % [INFO] Problem is higher-order (TPTP THF).
% 2.24/1.54 % [INFO] Type checking passed.
% 2.24/1.55 % [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.62/1.70 % [INFO] Killing All external provers ...
% 2.62/1.71 % Time passed: 1355ms (effective reasoning time: 707ms)
% 2.62/1.71 % 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.62/1.71 % Axioms used in derivation (0):
% 2.62/1.71 % No. of inferences in proof: 4
% 2.62/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1355 ms resp. 707 ms w/o parsing
% 2.62/1.76 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.76 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------