%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO371^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 : n016.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:40 AM UTC 2026
% Result : Theorem 3.47s 2.12s
% Output : Refutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 12 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 50 ( 20 ~; 10 |; 2 &; 6 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 3 ( 0 ^; 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
thf(cQ_decl,type,
cQ: $o ).
thf(cP_decl,type,
cP: $o ).
thf(1,conjecture,
( ! [A: $o > $o] :
( ( A @ cP )
=> ( A @ cQ ) )
=> ( cP = cQ ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT_O_LEIB) ).
thf(2,negated_conjecture,
~ ( ! [A: $o > $o] :
( ( A @ cP )
=> ( A @ cQ ) )
=> ( cP = cQ ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $o > $o] :
( ( A @ cP )
=> ( A @ cQ ) )
=> ( cP = cQ ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(9,plain,
~ ( ( ~ cP
=> ~ cQ )
=> ( cP = cQ ) ),
inference(instance,[status(thm)],[3]) ).
thf(13,plain,
( ( cP
| ~ cQ )
& ( cP != cQ ) ),
inference(cnf,[status(esa)],[9]) ).
thf(14,plain,
( cP
| ~ cQ ),
inference(cnfConj,[status(thm)],[13]) ).
thf(4,plain,
~ ( ( $true
=> $true )
=> ( cP = cQ ) ),
inference(instance,[status(thm)],[3]) ).
thf(5,plain,
cP != cQ,
inference(simp,[status(thm)],[4]) ).
thf(16,plain,
cP != cQ,
inference(lifteq,[status(thm)],[5]) ).
thf(21,plain,
( cP
| cQ ),
inference(bool_ext,[status(thm)],[16]) ).
thf(8,plain,
~ ( ( cP
=> cQ )
=> ( cP = cQ ) ),
inference(instance,[status(thm)],[3]) ).
thf(10,plain,
( ( ~ cP
| cQ )
& ( cP != cQ ) ),
inference(cnf,[status(esa)],[8]) ).
thf(11,plain,
( ~ cP
| cQ ),
inference(cnfConj,[status(thm)],[10]) ).
thf(27,plain,
( cQ
| ~ $true
| cQ
| ( cP != cP ) ),
inference(paramod_ordered,[status(thm)],[21,11]) ).
thf(28,plain,
( cQ
| ( cP != cP ) ),
inference(simp,[status(thm)],[27]) ).
thf(29,plain,
cQ,
inference(pattern_uni,[status(thm)],[28:[]]) ).
thf(30,plain,
~ cP,
inference(rewrite,[status(thm)],[16,29]) ).
thf(33,plain,
( $false
| ~ $true ),
inference(rewrite,[status(thm)],[14,29,30]) ).
thf(34,plain,
$false,
inference(simp,[status(thm)],[33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO371^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % 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.20 % Computer : n016.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 16:54:19 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 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.79 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.25/0.97 % [INFO] Parsing done (175ms).
% 1.25/0.98 % [INFO] Running in sequential loop mode.
% 1.85/1.38 % [INFO] eprover registered as external prover.
% 1.85/1.39 % [INFO] Scanning for conjecture ...
% 2.04/1.47 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.22/1.50 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.22/1.51 % [INFO] Problem is higher-order (TPTP THF).
% 2.22/1.52 % [INFO] Type checking passed.
% 2.22/1.52 % [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 ...
% 3.47/2.11 % [INFO] Killing All external provers ...
% 3.47/2.12 % Time passed: 1774ms (effective reasoning time: 1130ms)
% 3.47/2.12 % 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)>
% 3.47/2.12 % Axioms used in derivation (0):
% 3.47/2.12 % No. of inferences in proof: 19
% 3.47/2.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1774 ms resp. 1130 ms w/o parsing
% 3.72/2.15 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.72/2.15 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------