%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN401+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:29 AM UTC 2026
% Result : Theorem 3.01s 7.20s
% Output : Refutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 5 unt; 0 typ; 1 def)
% Number of atoms : 16 ( 1 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 7 ~; 0 |; 1 &; 13 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 ^; 10 !; 0 ?; 11 :)
% ( 0 !>; 0 ?*; 0 @-; 1 @+)
% Comments :
%------------------------------------------------------------------------------
thf(f_decl,type,
f: $i > $o ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk1_def,definition,
( sk1
= ( @+[A: $i] :
~ ( A @ f ) ) ) ).
thf(1,conjecture,
! [A: $i] :
( ! [B: $i] : ( B @ f )
=> ( A @ f ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish229) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ! [B: $i] : ( B @ f )
=> ( A @ f ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
( ! [B: $i] : ( B @ f )
=> ( A @ f ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ! [A: $i] : ( A @ f )
=> ! [A: $i] : ( A @ f ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [A: $i] :
( ~ ( sk1 @ f )
& ( A @ f ) ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
~ ( sk1 @ f ),
inference(cnfConj,[status(thm)],[5]) ).
thf(6,plain,
! [A: $i] : ( A @ f ),
inference(cnfConj,[status(thm)],[5]) ).
thf(8,plain,
~ $true,
inference(rewrite,[status(thm)],[7,6]) ).
thf(9,plain,
$false,
inference(simp,[status(thm)],[8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN401+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/5.42 % Computer : n010.cluster.edu
% 0.16/5.42 % Model : x86_64 x86_64
% 0.16/5.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.42 % Memory : 8046.5625MB
% 0.16/5.42 % OS : Linux 6.8.0-71-generic
% 0.16/5.42 % CPULimit : 300
% 0.16/5.42 % WCLimit : 300
% 0.16/5.42 % DateTime : Sat Sep 26 17:41:06 UTC 2026
% 0.16/5.42 % CPUTime :
% 0.16/5.42 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.19/6.01 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/6.18 % [INFO] Parsing done (166ms).
% 1.22/6.19 % [INFO] Running in sequential loop mode.
% 1.69/6.59 % [INFO] eprover registered as external prover.
% 1.69/6.59 % [INFO] Scanning for conjecture ...
% 1.86/6.67 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.03/6.71 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.03/6.71 % [INFO] Problem is first-order (TPTP FOF).
% 2.03/6.72 % [INFO] Type checking passed.
% 2.03/6.72 % [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.01/7.20 % [INFO] Killing All external provers ...
% 3.01/7.20 % Time passed: 1631ms (effective reasoning time: 1000ms)
% 3.01/7.20 % 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.01/7.20 % Axioms used in derivation (0):
% 3.01/7.20 % No. of inferences in proof: 9
% 3.01/7.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1631 ms resp. 1000 ms w/o parsing
% 3.01/7.24 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/7.24 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------