%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN389+1 : TPTP v9.3.1. Released v2.0.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 : Sun Sep 27 09:17:26 AM UTC 2026
% Result : Theorem 2.90s 2.09s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 19 ( 5 ~; 3 |; 2 &; 0 @)
% ( 0 <=>; 9 =>; 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 : 3 ( 2 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(p_decl,type,
p: $o ).
thf(q_decl,type,
q: $o ).
thf(1,conjecture,
( ( ( p
=> q )
=> p )
=> p ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel8) ).
thf(2,negated_conjecture,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ( p
=> q )
=> p )
=> p ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ~ p
& ( p
| ~ q )
& ( p
| p ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
( p
| p ),
inference(cnfConj,[status(thm)],[4]) ).
thf(8,plain,
p,
inference(simp,[status(thm)],[5]) ).
thf(7,plain,
~ p,
inference(cnfConj,[status(thm)],[4]) ).
thf(9,plain,
$false,
inference(rewrite,[status(thm)],[8,7]) ).
thf(10,plain,
$false,
inference(simp,[status(thm)],[9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN389+1 : TPTP v9.3.1. Released v2.0.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.16/0.41 % Computer : n010.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sat Sep 26 17:40:15 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 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
% 0.88/0.98 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.31/1.15 % [INFO] Parsing done (166ms).
% 1.31/1.17 % [INFO] Running in sequential loop mode.
% 1.83/1.58 % [INFO] eprover registered as external prover.
% 1.83/1.59 % [INFO] Scanning for conjecture ...
% 2.02/1.67 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.02/1.70 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.19/1.70 % [INFO] Problem is first-order (TPTP FOF).
% 2.19/1.70 % [INFO] Type checking passed.
% 2.19/1.71 % [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.90/2.08 % [INFO] Killing All external provers ...
% 2.90/2.09 % Time passed: 1527ms (effective reasoning time: 910ms)
% 2.90/2.09 % 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.90/2.09 % Axioms used in derivation (0):
% 2.90/2.09 % No. of inferences in proof: 9
% 2.90/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1527 ms resp. 910 ms w/o parsing
% 2.90/2.12 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.90/2.12 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------