%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : LCL656+1.005 : TPTP v9.3.1. Released v4.0.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 : 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 07:52:22 AM UTC 2026
% Result : Theorem 5.16s 3.97s
% Output : Refutation 5.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 6 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 390 ( 0 equ; 0 cnn)
% Maximal formula atoms : 129 ( 65 avg)
% Number of connectives : 1227 ( 356 ~; 222 |; 162 &; 487 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 20 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 14 usr; 1 con; 0-2 aty)
% Number of variables : 101 ( 0 ^; 98 !; 3 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
thf(r1_decl,type,
r1: $i > $i > $o ).
thf(p3_decl,type,
p3: $i > $o ).
thf(p6_decl,type,
p6: $i > $o ).
thf(p106_decl,type,
p106: $i > $o ).
thf(p105_decl,type,
p105: $i > $o ).
thf(p104_decl,type,
p104: $i > $o ).
thf(p5_decl,type,
p5: $i > $o ).
thf(p103_decl,type,
p103: $i > $o ).
thf(p4_decl,type,
p4: $i > $o ).
thf(p102_decl,type,
p102: $i > $o ).
thf(p101_decl,type,
p101: $i > $o ).
thf(p2_decl,type,
p2: $i > $o ).
thf(p100_decl,type,
p100: $i > $o ).
thf(p1_decl,type,
p1: $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ~ ( ( A @ p100 )
& ~ ( A @ p101 )
& ! [B: $i] :
( ! [C: $i] :
( ! [D: $i] :
( ! [E: $i] :
( ! [F: $i] :
( ( ( ~ ( F @ p101 )
| ( F @ p100 ) )
& ( ~ ( F @ p102 )
| ( F @ p101 ) )
& ( ~ ( F @ p103 )
| ( F @ p102 ) )
& ( ~ ( F @ p104 )
| ( F @ p103 ) )
& ( ~ ( F @ p105 )
| ( F @ p104 ) )
& ( ~ ( F @ p106 )
| ( F @ p105 ) )
& ( ~ ( F @ p100 )
| ( ( ~ ( F @ p1 )
| ! [G: $i] :
( ~ ( G @ p100 )
| ( G @ p1 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p1 )
| ! [G: $i] :
( ~ ( G @ p100 )
| ~ ( G @ p1 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p101 )
| ( ( ~ ( F @ p2 )
| ! [G: $i] :
( ~ ( G @ p101 )
| ( G @ p2 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p2 )
| ! [G: $i] :
( ~ ( G @ p101 )
| ~ ( G @ p2 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p102 )
| ( ( ~ ( F @ p3 )
| ! [G: $i] :
( ~ ( G @ p102 )
| ( G @ p3 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p3 )
| ! [G: $i] :
( ~ ( G @ p102 )
| ~ ( G @ p3 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p103 )
| ( ( ~ ( F @ p4 )
| ! [G: $i] :
( ~ ( G @ p103 )
| ( G @ p4 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p4 )
| ! [G: $i] :
( ~ ( G @ p103 )
| ~ ( G @ p4 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p104 )
| ( ( ~ ( F @ p5 )
| ! [G: $i] :
( ~ ( G @ p104 )
| ( G @ p5 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p5 )
| ! [G: $i] :
( ~ ( G @ p104 )
| ~ ( G @ p5 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p105 )
| ( ( ~ ( F @ p6 )
| ! [G: $i] :
( ~ ( G @ p105 )
| ( G @ p6 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p6 )
| ! [G: $i] :
( ~ ( G @ p105 )
| ~ ( G @ p6 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( ( F @ p100 )
& ~ ( F @ p101 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p101 )
& ~ ( G @ p102 )
& ( G @ p2 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p101 )
& ~ ( G @ p102 )
& ~ ( G @ p2 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p101 )
& ~ ( F @ p102 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p102 )
& ~ ( G @ p103 )
& ( G @ p3 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p102 )
& ~ ( G @ p103 )
& ~ ( G @ p3 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p102 )
& ~ ( F @ p103 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p103 )
& ~ ( G @ p104 )
& ( G @ p4 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p103 )
& ~ ( G @ p104 )
& ~ ( G @ p4 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p103 )
& ~ ( F @ p104 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p104 )
& ~ ( G @ p105 )
& ( G @ p5 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p104 )
& ~ ( G @ p105 )
& ~ ( G @ p5 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p104 )
& ~ ( F @ p105 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p105 )
& ~ ( G @ p106 )
& ( G @ p6 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p105 )
& ~ ( G @ p106 )
& ~ ( G @ p6 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
| ~ ( F @ ( E @ r1 ) ) )
| ~ ( E @ ( D @ r1 ) ) )
| ~ ( D @ ( C @ r1 ) ) )
| ~ ( C @ ( B @ r1 ) ) )
| ~ ( B @ ( A @ r1 ) ) ) )
| ~ ! [B: $i] :
( ! [C: $i] :
( ! [D: $i] :
( ! [E: $i] :
( ! [F: $i] :
( ( F @ p3 )
| ~ ( F @ ( E @ r1 ) ) )
| ~ ( E @ ( D @ r1 ) ) )
| ~ ( D @ ( C @ r1 ) ) )
| ~ ( C @ ( B @ r1 ) ) )
| ~ ( B @ ( A @ r1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ~ ( ( A @ p100 )
& ~ ( A @ p101 )
& ! [B: $i] :
( ! [C: $i] :
( ! [D: $i] :
( ! [E: $i] :
( ! [F: $i] :
( ( ( ~ ( F @ p101 )
| ( F @ p100 ) )
& ( ~ ( F @ p102 )
| ( F @ p101 ) )
& ( ~ ( F @ p103 )
| ( F @ p102 ) )
& ( ~ ( F @ p104 )
| ( F @ p103 ) )
& ( ~ ( F @ p105 )
| ( F @ p104 ) )
& ( ~ ( F @ p106 )
| ( F @ p105 ) )
& ( ~ ( F @ p100 )
| ( ( ~ ( F @ p1 )
| ! [G: $i] :
( ~ ( G @ p100 )
| ( G @ p1 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p1 )
| ! [G: $i] :
( ~ ( G @ p100 )
| ~ ( G @ p1 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p101 )
| ( ( ~ ( F @ p2 )
| ! [G: $i] :
( ~ ( G @ p101 )
| ( G @ p2 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p2 )
| ! [G: $i] :
( ~ ( G @ p101 )
| ~ ( G @ p2 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p102 )
| ( ( ~ ( F @ p3 )
| ! [G: $i] :
( ~ ( G @ p102 )
| ( G @ p3 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p3 )
| ! [G: $i] :
( ~ ( G @ p102 )
| ~ ( G @ p3 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p103 )
| ( ( ~ ( F @ p4 )
| ! [G: $i] :
( ~ ( G @ p103 )
| ( G @ p4 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p4 )
| ! [G: $i] :
( ~ ( G @ p103 )
| ~ ( G @ p4 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p104 )
| ( ( ~ ( F @ p5 )
| ! [G: $i] :
( ~ ( G @ p104 )
| ( G @ p5 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p5 )
| ! [G: $i] :
( ~ ( G @ p104 )
| ~ ( G @ p5 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p105 )
| ( ( ~ ( F @ p6 )
| ! [G: $i] :
( ~ ( G @ p105 )
| ( G @ p6 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p6 )
| ! [G: $i] :
( ~ ( G @ p105 )
| ~ ( G @ p6 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( ( F @ p100 )
& ~ ( F @ p101 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p101 )
& ~ ( G @ p102 )
& ( G @ p2 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p101 )
& ~ ( G @ p102 )
& ~ ( G @ p2 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p101 )
& ~ ( F @ p102 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p102 )
& ~ ( G @ p103 )
& ( G @ p3 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p102 )
& ~ ( G @ p103 )
& ~ ( G @ p3 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p102 )
& ~ ( F @ p103 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p103 )
& ~ ( G @ p104 )
& ( G @ p4 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p103 )
& ~ ( G @ p104 )
& ~ ( G @ p4 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p103 )
& ~ ( F @ p104 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p104 )
& ~ ( G @ p105 )
& ( G @ p5 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p104 )
& ~ ( G @ p105 )
& ~ ( G @ p5 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p104 )
& ~ ( F @ p105 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p105 )
& ~ ( G @ p106 )
& ( G @ p6 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p105 )
& ~ ( G @ p106 )
& ~ ( G @ p6 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
| ~ ( F @ ( E @ r1 ) ) )
| ~ ( E @ ( D @ r1 ) ) )
| ~ ( D @ ( C @ r1 ) ) )
| ~ ( C @ ( B @ r1 ) ) )
| ~ ( B @ ( A @ r1 ) ) ) )
| ~ ! [B: $i] :
( ! [C: $i] :
( ! [D: $i] :
( ! [E: $i] :
( ! [F: $i] :
( ( F @ p3 )
| ~ ( F @ ( E @ r1 ) ) )
| ~ ( E @ ( D @ r1 ) ) )
| ~ ( D @ ( C @ r1 ) ) )
| ~ ( C @ ( B @ r1 ) ) )
| ~ ( B @ ( A @ r1 ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ~ ? [A: $i] :
~ ( ~ ( ( A @ p100 )
& ~ ( A @ p101 )
& ! [B: $i] :
( ! [C: $i] :
( ! [D: $i] :
( ! [E: $i] :
( ! [F: $i] :
( ( ( ~ ( F @ p101 )
| ( F @ p100 ) )
& ( ~ ( F @ p102 )
| ( F @ p101 ) )
& ( ~ ( F @ p103 )
| ( F @ p102 ) )
& ( ~ ( F @ p104 )
| ( F @ p103 ) )
& ( ~ ( F @ p105 )
| ( F @ p104 ) )
& ( ~ ( F @ p106 )
| ( F @ p105 ) )
& ( ~ ( F @ p100 )
| ( ( ~ ( F @ p1 )
| ! [G: $i] :
( ~ ( G @ p100 )
| ( G @ p1 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p1 )
| ! [G: $i] :
( ~ ( G @ p100 )
| ~ ( G @ p1 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p101 )
| ( ( ~ ( F @ p2 )
| ! [G: $i] :
( ~ ( G @ p101 )
| ( G @ p2 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p2 )
| ! [G: $i] :
( ~ ( G @ p101 )
| ~ ( G @ p2 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p102 )
| ( ( ~ ( F @ p3 )
| ! [G: $i] :
( ~ ( G @ p102 )
| ( G @ p3 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p3 )
| ! [G: $i] :
( ~ ( G @ p102 )
| ~ ( G @ p3 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p103 )
| ( ( ~ ( F @ p4 )
| ! [G: $i] :
( ~ ( G @ p103 )
| ( G @ p4 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p4 )
| ! [G: $i] :
( ~ ( G @ p103 )
| ~ ( G @ p4 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p104 )
| ( ( ~ ( F @ p5 )
| ! [G: $i] :
( ~ ( G @ p104 )
| ( G @ p5 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p5 )
| ! [G: $i] :
( ~ ( G @ p104 )
| ~ ( G @ p5 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( F @ p105 )
| ( ( ~ ( F @ p6 )
| ! [G: $i] :
( ~ ( G @ p105 )
| ( G @ p6 )
| ~ ( G @ ( F @ r1 ) ) ) )
& ( ( F @ p6 )
| ! [G: $i] :
( ~ ( G @ p105 )
| ~ ( G @ p6 )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
& ( ~ ( ( F @ p100 )
& ~ ( F @ p101 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p101 )
& ~ ( G @ p102 )
& ( G @ p2 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p101 )
& ~ ( G @ p102 )
& ~ ( G @ p2 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p101 )
& ~ ( F @ p102 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p102 )
& ~ ( G @ p103 )
& ( G @ p3 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p102 )
& ~ ( G @ p103 )
& ~ ( G @ p3 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p102 )
& ~ ( F @ p103 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p103 )
& ~ ( G @ p104 )
& ( G @ p4 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p103 )
& ~ ( G @ p104 )
& ~ ( G @ p4 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p103 )
& ~ ( F @ p104 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p104 )
& ~ ( G @ p105 )
& ( G @ p5 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p104 )
& ~ ( G @ p105 )
& ~ ( G @ p5 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) )
& ( ~ ( ( F @ p104 )
& ~ ( F @ p105 ) )
| ( ~ ! [G: $i] :
( ~ ( ( G @ p105 )
& ~ ( G @ p106 )
& ( G @ p6 ) )
| ~ ( G @ ( F @ r1 ) ) )
& ~ ! [G: $i] :
( ~ ( ( G @ p105 )
& ~ ( G @ p106 )
& ~ ( G @ p6 ) )
| ~ ( G @ ( F @ r1 ) ) ) ) ) )
| ~ ( F @ ( E @ r1 ) ) )
| ~ ( E @ ( D @ r1 ) ) )
| ~ ( D @ ( C @ r1 ) ) )
| ~ ( C @ ( B @ r1 ) ) )
| ~ ( B @ ( A @ r1 ) ) ) )
| ~ ! [B: $i] :
( ! [C: $i] :
( ! [D: $i] :
( ! [E: $i] :
( ! [F: $i] :
( ( F @ p3 )
| ~ ( F @ ( E @ r1 ) ) )
| ~ ( E @ ( D @ r1 ) ) )
| ~ ( D @ ( C @ r1 ) ) )
| ~ ( C @ ( B @ r1 ) ) )
| ~ ( B @ ( A @ r1 ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] : ( A @ ( A @ r1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
thf(127,plain,
! [A: $i] : ( A @ ( A @ r1 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(129,plain,
$false,
inference(e,[status(thm)],[4,127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL656+1.005 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % 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.07/0.41 % Computer : n010.cluster.edu
% 0.07/0.41 % Model : x86_64 x86_64
% 0.07/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.41 % Memory : 8046.5625MB
% 0.07/0.41 % OS : Linux 6.8.0-71-generic
% 0.07/0.41 % CPULimit : 300
% 0.07/0.41 % WCLimit : 300
% 0.07/0.41 % DateTime : Fri Sep 25 23:02:15 UTC 2026
% 0.07/0.41 % CPUTime :
% 0.07/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.75/1.06 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.16/1.31 % [INFO] Parsing done (244ms).
% 1.16/1.35 % [INFO] Running in sequential loop mode.
% 1.81/1.87 % [INFO] eprover registered as external prover.
% 1.81/1.88 % [INFO] Scanning for conjecture ...
% 2.17/2.12 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.43/2.21 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.43/2.22 % [INFO] Problem is first-order (TPTP FOF).
% 2.43/2.24 % [INFO] Type checking passed.
% 2.43/2.25 % [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 ...
% 5.16/3.97 % External prover 'e' found a proof!
% 5.16/3.97 % [INFO] Killing All external provers ...
% 5.16/3.97 % Time passed: 3336ms (effective reasoning time: 2603ms)
% 5.16/3.97 % 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)>
% 5.16/3.97 % Axioms used in derivation (1): reflexivity
% 5.16/3.97 % No. of inferences in proof: 6
% 5.16/3.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 3336 ms resp. 2603 ms w/o parsing
% 5.59/4.05 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.59/4.05 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------