%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN084-2 : TPTP v9.3.1. Released v1.2.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 : n015.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:16:47 AM UTC 2026
% Result : Unsatisfiable 3.05s 2.58s
% Output : Refutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 118 ( 22 ~; 24 |; 0 &; 72 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 4 ( 0 ^; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_p_decl,type,
big_p: $i > $o ).
thf(a_decl,type,
a: $i ).
thf(f_decl,type,
f: $i > $i ).
thf(sk1_decl,type,
sk1: $i ).
thf(sk2_decl,type,
sk2: $i ).
thf(6,negated_conjecture,
( ~ ( sk2 @ f @ f @ big_p )
| ~ ( sk1 @ big_p )
| ( sk1 @ f @ big_p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_6) ).
thf(10,plain,
( ~ ( sk2 @ f @ f @ big_p )
| ~ ( sk1 @ big_p )
| ( sk1 @ f @ big_p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,negated_conjecture,
( ~ ( sk2 @ f @ f @ big_p )
| ~ ( sk1 @ f @ f @ big_p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_4) ).
thf(14,plain,
( ~ ( sk2 @ f @ f @ big_p )
| ~ ( sk1 @ f @ f @ big_p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(1,negated_conjecture,
a @ big_p,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_1) ).
thf(9,plain,
a @ big_p,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(3,negated_conjecture,
! [A: $i] :
( ~ ( a @ big_p )
| ~ ( A @ f @ big_p )
| ( A @ f @ f @ big_p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_3) ).
thf(13,plain,
! [A: $i] :
( ~ ( a @ big_p )
| ~ ( A @ f @ big_p )
| ( A @ f @ f @ big_p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,negated_conjecture,
( ~ ( sk1 @ f @ f @ big_p )
| ~ ( sk2 @ big_p )
| ( sk2 @ f @ big_p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_7) ).
thf(12,plain,
( ~ ( sk1 @ f @ f @ big_p )
| ~ ( sk2 @ big_p )
| ( sk2 @ f @ big_p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,negated_conjecture,
! [A: $i] :
( ~ ( a @ big_p )
| ( A @ big_p )
| ( A @ f @ f @ big_p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_2) ).
thf(11,plain,
! [A: $i] :
( ~ ( a @ big_p )
| ( A @ big_p )
| ( A @ f @ f @ big_p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,negated_conjecture,
( ~ ( sk2 @ big_p )
| ~ ( sk1 @ big_p )
| ( sk2 @ f @ big_p )
| ( sk1 @ f @ big_p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel62_5) ).
thf(8,plain,
( ~ ( sk2 @ big_p )
| ~ ( sk1 @ big_p )
| ( sk2 @ f @ big_p )
| ( sk1 @ f @ big_p ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(30,plain,
$false,
inference(e,[status(thm)],[10,14,9,13,12,11,8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN084-2 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.08 % 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.12/0.40 % Computer : n015.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sat Sep 26 17:13:44 UTC 2026
% 0.12/0.41 % CPUTime :
% 0.12/0.41 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/1.28 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.35/1.50 % [INFO] Parsing done (212ms).
% 1.35/1.51 % [INFO] Running in sequential loop mode.
% 1.94/1.90 % [INFO] eprover registered as external prover.
% 1.94/1.91 % [INFO] Scanning for conjecture ...
% 1.94/2.01 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.13/2.05 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.13/2.05 % [INFO] Problem is propositional (TPTP CNF).
% 2.13/2.05 % [INFO] Type checking passed.
% 2.13/2.06 % [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.05/2.58 % External prover 'e' found a proof!
% 3.05/2.58 % [INFO] Killing All external provers ...
% 3.05/2.58 % Time passed: 1898ms (effective reasoning time: 1062ms)
% 3.05/2.58 % Axioms used in derivation (0):
% 3.05/2.58 % No. of inferences in proof: 15
% 3.05/2.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1898 ms resp. 1062 ms w/o parsing
% 3.34/2.62 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.34/2.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------