%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYO013^1 : TPTP v9.3.1. Released v3.7.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 : n010.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:01 AM UTC 2026
% Result : Theorem 3.04s 2.01s
% Output : Refutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 29 ( 5 ~; 0 |; 9 &; 12 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_decl,type,
a: $o ).
thf(b_decl,type,
b: $o ).
thf(p_decl,type,
p: $o > $o ).
thf(1,conjecture,
( ( a
& b
& ( p @ a ) )
=> ( p @ b ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ( ( a
& b
& ( p @ a ) )
=> ( p @ b ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( a
& b
& ( p @ a ) )
=> ( p @ b ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( a
& b
& ( p @ a )
& ~ ( p @ b ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
p @ a,
inference(cnfConj,[status(thm)],[4]) ).
thf(5,plain,
a,
inference(cnfConj,[status(thm)],[4]) ).
thf(9,plain,
p @ $true,
inference(rewrite,[status(thm)],[7,5]) ).
thf(8,plain,
~ ( p @ b ),
inference(cnfConj,[status(thm)],[4]) ).
thf(6,plain,
b,
inference(cnfConj,[status(thm)],[4]) ).
thf(10,plain,
~ ( p @ $true ),
inference(rewrite,[status(thm)],[8,6]) ).
thf(11,plain,
$false,
inference(rewrite,[status(thm)],[9,10]) ).
thf(12,plain,
$false,
inference(simp,[status(thm)],[11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO013^1 : TPTP v9.3.1. Released v3.7.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.10/0.20 % Computer : n010.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:21:48 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 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
% 1.05/0.80 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.24/0.98 % [INFO] Parsing done (180ms).
% 1.24/1.00 % [INFO] Running in sequential loop mode.
% 2.03/1.41 % [INFO] eprover registered as external prover.
% 2.03/1.42 % [INFO] Scanning for conjecture ...
% 2.03/1.49 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.20/1.52 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.20/1.52 % [INFO] Problem is higher-order (TPTP THF).
% 2.20/1.53 % [INFO] Type checking passed.
% 2.20/1.53 % [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.04/2.00 % [INFO] Killing All external provers ...
% 3.04/2.01 % Time passed: 1653ms (effective reasoning time: 1000ms)
% 3.04/2.01 % 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.04/2.01 % Axioms used in derivation (0):
% 3.04/2.01 % No. of inferences in proof: 12
% 3.04/2.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1653 ms resp. 1000 ms w/o parsing
% 3.38/2.04 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.38/2.04 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------