%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SYN082+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 : 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:46 AM UTC 2026
% Result : Theorem 3.60s 2.31s
% Output : Refutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 0 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 55 ( 2 ~; 0 |; 5 &; 40 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 11 ( 0 ^; 7 !; 4 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_decl,type,
big_f: $i > $i > $o ).
thf(f_decl,type,
f: $i > $i ).
thf(1,conjecture,
! [A: $i] :
( ( A @ f @ ( A @ big_f ) )
<=> ? [B: $i] :
( ( B @ ( A @ big_f ) )
& ! [C: $i] :
( ( B @ ( C @ big_f ) )
=> ( A @ f @ ( C @ big_f ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel60) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( A @ f @ ( A @ big_f ) )
<=> ? [B: $i] :
( ( B @ ( A @ big_f ) )
& ! [C: $i] :
( ( B @ ( C @ big_f ) )
=> ( A @ f @ ( C @ big_f ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
( ( ? [B: $i] :
( ( B @ ( A @ big_f ) )
& ! [C: $i] :
( ( B @ ( C @ big_f ) )
=> ( A @ f @ ( C @ big_f ) ) ) )
=> ( A @ f @ ( A @ big_f ) ) )
& ( ( A @ f @ ( A @ big_f ) )
=> ? [B: $i] :
( ( B @ ( A @ big_f ) )
& ! [C: $i] :
( ( B @ ( C @ big_f ) )
=> ( A @ f @ ( C @ big_f ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(17,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN082+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.15/0.41 % Computer : n015.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Sat Sep 26 17:13:59 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/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/1.00 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.27/1.18 % [INFO] Parsing done (177ms).
% 1.27/1.20 % [INFO] Running in sequential loop mode.
% 1.82/1.60 % [INFO] eprover registered as external prover.
% 2.02/1.60 % [INFO] Scanning for conjecture ...
% 2.02/1.69 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.19/1.73 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.19/1.73 % [INFO] Problem is first-order (TPTP FOF).
% 2.19/1.74 % [INFO] Type checking passed.
% 2.19/1.74 % [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.60/2.31 % External prover 'e' found a proof!
% 3.60/2.31 % [INFO] Killing All external provers ...
% 3.60/2.31 % Time passed: 1755ms (effective reasoning time: 1110ms)
% 3.60/2.31 % 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.60/2.31 % Axioms used in derivation (0):
% 3.60/2.31 % No. of inferences in proof: 4
% 3.60/2.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1755 ms resp. 1110 ms w/o parsing
% 3.60/2.35 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.60/2.35 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------