%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : MGT070+1 : TPTP v9.3.1. Released v9.3.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 : n012.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:00:50 AM UTC 2026
% Result : Theorem 3.59s 1.96s
% Output : Refutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 28
% Syntax : Number of formulae : 58 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 188 ( 7 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 580 ( 7 ~; 7 |; 68 &; 443 @)
% ( 8 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 4 con; 0-4 aty)
% Number of variables : 164 ( 0 ^; 153 !; 11 ?; 164 :)
% Comments :
%------------------------------------------------------------------------------
thf(leq_decl,type,
leq: $i > $i > $o ).
thf(ninf_decl,type,
ninf: $i ).
thf(nsup_decl,type,
nsup: $i ).
thf(completion_compatible_decl,type,
completion_compatible: $i > $i > $i > $o ).
thf(axis_subsumes_decl,type,
axis_subsumes: $i > $i > $i > $i > $o ).
thf(axis_conflict_decl,type,
axis_conflict: $i > $i > $i > $i > $o ).
thf(in_closed_decl,type,
in_closed: $i > $i > $i > $o ).
thf(less_decl,type,
less: $i > $i > $o ).
thf(axis_compatible_decl,type,
axis_compatible: $i > $i > $i > $i > $o ).
thf(in_open_decl,type,
in_open: $i > $i > $i > $o ).
thf(completion_conflict_decl,type,
completion_conflict: $i > $i > $i > $i > $o ).
thf(n0_decl,type,
n0: $i ).
thf(in_ropen_decl,type,
in_ropen: $i > $i > $i > $o ).
thf(in_lopen_decl,type,
in_lopen: $i > $i > $i > $o ).
thf(27,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ leq ) )
<=> ( ( A = B )
| ( B @ ( A @ less ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_def) ).
thf(115,plain,
! [A: $i,B: $i] :
( ( ( ( A = B )
| ( B @ ( A @ less ) ) )
=> ( B @ ( A @ leq ) ) )
& ( ( B @ ( A @ leq ) )
=> ( ( A = B )
| ( B @ ( A @ less ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[27]) ).
thf(5,axiom,
! [A: $i] :
~ ( A @ ( A @ less ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexive) ).
thf(42,plain,
! [A: $i] :
~ ( A @ ( A @ less ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(28,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ leq ) )
& ( B @ ( A @ leq ) ) )
=> ( C @ ( A @ leq ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_trans) ).
thf(125,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ leq ) )
& ( B @ ( A @ leq ) ) )
=> ( C @ ( A @ leq ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[28]) ).
thf(10,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ less ) )
=> ? [C: $i] :
( ( B @ ( C @ less ) )
& ( C @ ( A @ less ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dense) ).
thf(65,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ less ) )
=> ? [C: $i] :
( ( B @ ( C @ less ) )
& ( C @ ( A @ less ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(22,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ in_ropen ) ) )
<=> ( ( C @ ( A @ less ) )
& ( A @ ( B @ leq ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_ropen) ).
thf(96,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( C @ ( A @ less ) )
& ( A @ ( B @ leq ) ) )
=> ( C @ ( B @ ( A @ in_ropen ) ) ) )
& ( ( C @ ( B @ ( A @ in_ropen ) ) )
=> ( ( C @ ( A @ less ) )
& ( A @ ( B @ leq ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).
thf(26,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( D @ ( B @ leq ) )
& ( B @ ( A @ less ) )
& ( D @ ( A @ leq ) )
& ( A @ ( C @ leq ) ) )
=> ( D @ ( C @ ( A @ completion_compatible ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sharpness_compat) ).
thf(113,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( D @ ( B @ leq ) )
& ( B @ ( A @ less ) )
& ( D @ ( A @ leq ) )
& ( A @ ( C @ leq ) ) )
=> ( D @ ( C @ ( A @ completion_compatible ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[26]) ).
thf(23,axiom,
nsup @ ( n0 @ less ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_0_sup) ).
thf(103,plain,
nsup @ ( n0 @ less ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).
thf(14,axiom,
! [A: $i] : ( nsup @ ( A @ leq ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_sup_ub) ).
thf(80,plain,
! [A: $i] : ( nsup @ ( A @ leq ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(29,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ in_closed ) ) )
<=> ( ( C @ ( A @ leq ) )
& ( A @ ( B @ leq ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_closed) ).
thf(127,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( C @ ( A @ leq ) )
& ( A @ ( B @ leq ) ) )
=> ( C @ ( B @ ( A @ in_closed ) ) ) )
& ( ( C @ ( B @ ( A @ in_closed ) ) )
=> ( ( C @ ( A @ leq ) )
& ( A @ ( B @ leq ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[29]) ).
thf(24,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( A @ leq ) )
& ( A @ ( B @ leq ) ) )
=> ( C @ ( B @ ( A @ completion_compatible ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',completion_compat) ).
thf(104,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( A @ leq ) )
& ( A @ ( B @ leq ) ) )
=> ( C @ ( B @ ( A @ completion_compatible ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[24]) ).
thf(8,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) )
<=> ! [E: $i] :
( ( B @ ( A @ ( E @ in_closed ) ) )
=> ( D @ ( C @ ( E @ in_closed ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axis_subsumes_def) ).
thf(55,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ! [E: $i] :
( ( B @ ( A @ ( E @ in_closed ) ) )
=> ( D @ ( C @ ( E @ in_closed ) ) ) )
=> ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) ) )
& ( ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) )
=> ! [E: $i] :
( ( B @ ( A @ ( E @ in_closed ) ) )
=> ( D @ ( C @ ( E @ in_closed ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(15,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( B @ ( A @ less ) )
& ( D @ ( B @ leq ) )
& ( B @ ( C @ leq ) )
& ( D @ ( A @ leq ) )
& ( A @ ( C @ leq ) ) )
=> ( D @ ( C @ ( B @ ( A @ completion_conflict ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',completion_conflict) ).
thf(82,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( B @ ( A @ less ) )
& ( D @ ( B @ leq ) )
& ( B @ ( C @ leq ) )
& ( D @ ( A @ leq ) )
& ( A @ ( C @ leq ) ) )
=> ( D @ ( C @ ( B @ ( A @ completion_conflict ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(1,conjecture,
? [A: $i] :
( ( nsup @ ( ninf @ ( A @ completion_compatible ) ) )
& ( nsup @ ( A @ leq ) )
& ( A @ ( ninf @ leq ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown_sound_compatible) ).
thf(2,negated_conjecture,
~ ? [A: $i] :
( ( nsup @ ( ninf @ ( A @ completion_compatible ) ) )
& ( nsup @ ( A @ leq ) )
& ( A @ ( ninf @ leq ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(30,plain,
~ ? [A: $i] :
( ( nsup @ ( ninf @ ( A @ completion_compatible ) ) )
& ( nsup @ ( A @ leq ) )
& ( A @ ( ninf @ leq ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(19,axiom,
! [A: $i,B: $i] :
( ( ( A @ ( B @ leq ) )
& ( B @ ( A @ leq ) ) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_antisym) ).
thf(90,plain,
! [A: $i,B: $i] :
( ( ( A @ ( B @ leq ) )
& ( B @ ( A @ leq ) ) )
=> ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).
thf(11,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ less ) )
& ( B @ ( A @ less ) ) )
=> ( C @ ( A @ less ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive) ).
thf(69,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ less ) )
& ( B @ ( A @ less ) ) )
=> ( C @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(18,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ leq ) )
& ( B @ ( A @ less ) ) )
=> ( C @ ( A @ less ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_leq_trans) ).
thf(88,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ leq ) )
& ( B @ ( A @ less ) ) )
=> ( C @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(20,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ less ) )
& ( B @ ( A @ leq ) ) )
=> ( C @ ( A @ less ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_less_trans) ).
thf(93,plain,
! [A: $i,B: $i,C: $i] :
( ( ( C @ ( B @ less ) )
& ( B @ ( A @ leq ) ) )
=> ( C @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).
thf(13,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( D @ ( B @ leq ) )
& ( B @ ( A @ less ) )
& ( D @ ( A @ leq ) )
& ( A @ ( C @ leq ) ) )
=> ( D @ ( C @ ( B @ ( A @ completion_conflict ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sharpness_conflict) ).
thf(78,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( D @ ( B @ leq ) )
& ( B @ ( A @ less ) )
& ( D @ ( A @ leq ) )
& ( A @ ( C @ leq ) ) )
=> ( D @ ( C @ ( B @ ( A @ completion_conflict ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(25,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ in_lopen ) ) )
<=> ( ( C @ ( A @ leq ) )
& ( A @ ( B @ less ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_lopen) ).
thf(106,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( C @ ( A @ leq ) )
& ( A @ ( B @ less ) ) )
=> ( C @ ( B @ ( A @ in_lopen ) ) ) )
& ( ( C @ ( B @ ( A @ in_lopen ) ) )
=> ( ( C @ ( A @ leq ) )
& ( A @ ( B @ less ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[25]) ).
thf(16,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ less ) )
=> ( B @ ( A @ leq ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_implies_leq) ).
thf(84,plain,
! [A: $i,B: $i] :
( ( B @ ( A @ less ) )
=> ( B @ ( A @ leq ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( A @ ( B @ less ) )
| ( A = B )
| ( B @ ( A @ less ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',trichotomy) ).
thf(45,plain,
! [A: $i,B: $i] :
( ( A @ ( B @ less ) )
| ( A = B )
| ( B @ ( A @ less ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
( ( ( F @ ( E @ ( D @ ( C @ axis_conflict ) ) ) )
& ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) ) )
=> ( F @ ( E @ ( B @ ( A @ axis_conflict ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotone_conflict) ).
thf(32,plain,
! [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i] :
( ( ( F @ ( E @ ( D @ ( C @ axis_conflict ) ) ) )
& ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) ) )
=> ( F @ ( E @ ( B @ ( A @ axis_conflict ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ ( B @ ( A @ axis_conflict ) ) ) )
<=> ~ ? [E: $i] :
( ( D @ ( C @ ( E @ in_closed ) ) )
& ( B @ ( A @ ( E @ in_closed ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axis_conflict_def) ).
thf(34,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ~ ? [E: $i] :
( ( D @ ( C @ ( E @ in_closed ) ) )
& ( B @ ( A @ ( E @ in_closed ) ) ) )
=> ( D @ ( C @ ( B @ ( A @ axis_conflict ) ) ) ) )
& ( ( D @ ( C @ ( B @ ( A @ axis_conflict ) ) ) )
=> ~ ? [E: $i] :
( ( D @ ( C @ ( E @ in_closed ) ) )
& ( B @ ( A @ ( E @ in_closed ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(12,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ in_open ) ) )
<=> ( ( C @ ( A @ less ) )
& ( A @ ( B @ less ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_open) ).
thf(71,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( C @ ( A @ less ) )
& ( A @ ( B @ less ) ) )
=> ( C @ ( B @ ( A @ in_open ) ) ) )
& ( ( C @ ( B @ ( A @ in_open ) ) )
=> ( ( C @ ( A @ less ) )
& ( A @ ( B @ less ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(17,axiom,
! [A: $i] : ( A @ ( ninf @ leq ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_lb) ).
thf(86,plain,
! [A: $i] : ( A @ ( ninf @ leq ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(7,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ ( B @ ( A @ axis_compatible ) ) ) )
<=> ? [E: $i] :
( ( D @ ( C @ ( E @ in_closed ) ) )
& ( B @ ( A @ ( E @ in_closed ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axis_compatible_def) ).
thf(48,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ? [E: $i] :
( ( D @ ( C @ ( E @ in_closed ) ) )
& ( B @ ( A @ ( E @ in_closed ) ) ) )
=> ( D @ ( C @ ( B @ ( A @ axis_compatible ) ) ) ) )
& ( ( D @ ( C @ ( B @ ( A @ axis_compatible ) ) ) )
=> ? [E: $i] :
( ( D @ ( C @ ( E @ in_closed ) ) )
& ( B @ ( A @ ( E @ in_closed ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(9,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) )
=> ! [E: $i] :
( ( B @ ( A @ ( E @ in_closed ) ) )
=> ( D @ ( C @ ( E @ in_closed ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redundancy) ).
thf(63,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( D @ ( C @ ( B @ ( A @ axis_subsumes ) ) ) )
=> ! [E: $i] :
( ( B @ ( A @ ( E @ in_closed ) ) )
=> ( D @ ( C @ ( E @ in_closed ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(21,axiom,
n0 @ ( ninf @ less ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_inf_0) ).
thf(95,plain,
n0 @ ( ninf @ less ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).
thf(134,plain,
$false,
inference(e,[status(thm)],[115,42,125,65,96,113,103,80,127,104,55,82,30,90,69,88,93,78,106,84,45,32,34,71,86,48,63,95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % 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.05/0.32 % Computer : n012.cluster.edu
% 0.05/0.32 % Model : x86_64 x86_64
% 0.05/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.32 % Memory : 8046.5625MB
% 0.05/0.32 % OS : Linux 6.8.0-71-generic
% 0.05/0.32 % CPULimit : 300
% 0.05/0.32 % WCLimit : 300
% 0.05/0.32 % DateTime : Sat Sep 26 00:11:20 UTC 2026
% 0.05/0.32 % CPUTime :
% 0.05/0.33 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.62/0.79 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.95/0.99 % [INFO] Parsing done (200ms).
% 0.95/1.00 % [INFO] Running in sequential loop mode.
% 1.63/1.23 % [INFO] eprover registered as external prover.
% 1.63/1.23 % [INFO] Scanning for conjecture ...
% 1.63/1.29 % [INFO] Found a conjecture (or negated_conjecture) and 39 axioms. Running axiom selection ...
% 1.87/1.35 % [INFO] Axiom selection finished. Selected 27 axioms (removed 12 axioms).
% 2.08/1.40 % [INFO] Problem is first-order (TPTP FOF).
% 2.08/1.40 % [INFO] Type checking passed.
% 2.08/1.41 % [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.59/1.96 % External prover 'e' found a proof!
% 3.59/1.96 % [INFO] Killing All external provers ...
% 3.59/1.96 % Time passed: 1513ms (effective reasoning time: 951ms)
% 3.59/1.96 % 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.59/1.96 % Axioms used in derivation (27): leq_antisym, dense, irreflexive, h_sup_ub, less_leq_trans, redundancy, transitive, axis_subsumes_def, less_implies_leq, in_ropen, completion_compat, sharpness_compat, leq_trans, leq_less_trans, h_inf_0, h_inf_lb, axis_conflict_def, in_closed, in_lopen, h_0_sup, completion_conflict, axis_compatible_def, trichotomy, in_open, sharpness_conflict, monotone_conflict, leq_def
% 3.59/1.96 % No. of inferences in proof: 58
% 3.59/1.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1513 ms resp. 951 ms w/o parsing
% 3.59/2.03 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.59/2.03 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------