%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SET786+1 : TPTP v9.3.1. Released v2.5.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 : n005.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 08:30:53 AM UTC 2026
% Result : Theorem 4.78s 3.30s
% Output : Refutation 4.78s
% 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 : 13 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 42 ( 9 ~; 0 |; 5 &; 24 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 9 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 2 ( 1 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 0 ^; 3 !; 7 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(element_decl,type,
element: $i > $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
! [B: $i] :
( ( A @ ( B @ element ) )
<=> ~ ? [C: $i] :
( ( B @ ( C @ element ) )
& ( C @ ( B @ element ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm25) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
! [B: $i] :
( ( A @ ( B @ element ) )
<=> ~ ? [C: $i] :
( ( B @ ( C @ element ) )
& ( C @ ( B @ element ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ~ ? [A: $i] :
! [B: $i] :
( ( ~ ? [C: $i] :
( ( B @ ( C @ element ) )
& ( C @ ( B @ element ) ) )
=> ( A @ ( B @ element ) ) )
& ( ( A @ ( B @ element ) )
=> ~ ? [C: $i] :
( ( B @ ( C @ element ) )
& ( C @ ( B @ element ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(16,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET786+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.10 % 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.22/0.47 % Computer : n005.cluster.edu
% 0.22/0.47 % Model : x86_64 x86_64
% 0.22/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47 % Memory : 8046.5625MB
% 0.22/0.47 % OS : Linux 6.8.0-71-generic
% 0.22/0.47 % CPULimit : 300
% 0.22/0.47 % WCLimit : 300
% 0.22/0.47 % DateTime : Sat Sep 26 08:15:46 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 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
% 1.32/1.37 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.78/1.63 % [INFO] Parsing done (258ms).
% 1.78/1.65 % [INFO] Running in sequential loop mode.
% 2.60/2.30 % [INFO] eprover registered as external prover.
% 2.80/2.31 % [INFO] Scanning for conjecture ...
% 2.97/2.44 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.97/2.49 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.97/2.49 % [INFO] Problem is first-order (TPTP FOF).
% 3.09/2.50 % [INFO] Type checking passed.
% 3.09/2.51 % [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 ...
% 4.43/3.30 % External prover 'e' found a proof!
% 4.43/3.30 % [INFO] Killing All external provers ...
% 4.78/3.30 % Time passed: 2599ms (effective reasoning time: 1633ms)
% 4.78/3.30 % 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)>
% 4.78/3.30 % Axioms used in derivation (0):
% 4.78/3.30 % No. of inferences in proof: 4
% 4.78/3.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2599 ms resp. 1633 ms w/o parsing
% 4.78/3.35 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.78/3.35 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------