%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT292+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 : Thu Sep 24 01:06:01 PM UTC 2026
% Result : Theorem 68.10s 11.28s
% Output : CNFRefutation 68.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 189 ( 4 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 246 ( 86 ~; 79 |; 70 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t44_lopclset,conjecture,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( r1_filter_1(X1,k6_lopclset(X2))
& l1_pre_topc(X2)
& v2_pre_topc(X2)
& ~ v3_struct_0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_lopclset) ).
fof(d9_lopclset,axiom,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_lopclset) ).
fof(t43_lopclset,axiom,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> r1_filter_1(X1,k12_lopclset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_lopclset) ).
fof(dt_k11_lopclset,axiom,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ( l1_pre_topc(k11_lopclset(X1))
& v2_pre_topc(k11_lopclset(X1))
& v1_pre_topc(k11_lopclset(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k11_lopclset) ).
fof(fc4_lopclset,axiom,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ( v2_pre_topc(k11_lopclset(X1))
& v1_pre_topc(k11_lopclset(X1))
& ~ v3_struct_0(k11_lopclset(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_lopclset) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( r1_filter_1(X1,k6_lopclset(X2))
& l1_pre_topc(X2)
& v2_pre_topc(X2)
& ~ v3_struct_0(X2) ) ),
inference(assume_negation,[status(cth)],[t44_lopclset]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( r1_filter_1(X1,k6_lopclset(X2))
& l1_pre_topc(X2)
& v2_pre_topc(X2)
& ~ v3_struct_0(X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[d9_lopclset]) ).
fof(c_0_8,negated_conjecture,
! [X16] :
( ( ~ r1_filter_1(esk1_0,k6_lopclset(X16))
| ~ l1_pre_topc(X16)
| ~ v2_pre_topc(X16)
| v3_struct_0(X16) )
& l3_lattices(esk1_0)
& ~ v3_realset2(esk1_0)
& v17_lattices(esk1_0)
& v10_lattices(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,plain,
! [X214] :
( k12_lopclset(X214) = k6_lopclset(k11_lopclset(X214))
| ~ l3_lattices(X214)
| v3_realset2(X214)
| ~ v17_lattices(X214)
| ~ v10_lattices(X214)
| v3_struct_0(X214) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> r1_filter_1(X1,k12_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t43_lopclset]) ).
fof(c_0_11,plain,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ( l1_pre_topc(k11_lopclset(X1))
& v2_pre_topc(k11_lopclset(X1))
& v1_pre_topc(k11_lopclset(X1)) ) ),
inference(fof_simplification,[status(thm)],[dt_k11_lopclset]) ).
fof(c_0_12,plain,
! [X1] :
( ( l3_lattices(X1)
& ~ v3_realset2(X1)
& v17_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ( v2_pre_topc(k11_lopclset(X1))
& v1_pre_topc(k11_lopclset(X1))
& ~ v3_struct_0(k11_lopclset(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc4_lopclset]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1_filter_1(esk1_0,k6_lopclset(X1))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| k12_lopclset(X1) = k6_lopclset(k11_lopclset(X1))
| v3_realset2(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X30] :
( r1_filter_1(X30,k12_lopclset(X30))
| ~ l3_lattices(X30)
| v3_realset2(X30)
| ~ v17_lattices(X30)
| ~ v10_lattices(X30)
| v3_struct_0(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X2335] :
( ( ~ l3_lattices(X2335)
| v3_realset2(X2335)
| ~ v17_lattices(X2335)
| ~ v10_lattices(X2335)
| v3_struct_0(X2335)
| l1_pre_topc(k11_lopclset(X2335)) )
& ( ~ l3_lattices(X2335)
| v3_realset2(X2335)
| ~ v17_lattices(X2335)
| ~ v10_lattices(X2335)
| v3_struct_0(X2335)
| v2_pre_topc(k11_lopclset(X2335)) )
& ( ~ l3_lattices(X2335)
| v3_realset2(X2335)
| ~ v17_lattices(X2335)
| ~ v10_lattices(X2335)
| v3_struct_0(X2335)
| v1_pre_topc(k11_lopclset(X2335)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_17,plain,
! [X2336] :
( ( ~ l3_lattices(X2336)
| v3_realset2(X2336)
| ~ v17_lattices(X2336)
| ~ v10_lattices(X2336)
| v3_struct_0(X2336)
| v2_pre_topc(k11_lopclset(X2336)) )
& ( ~ l3_lattices(X2336)
| v3_realset2(X2336)
| ~ v17_lattices(X2336)
| ~ v10_lattices(X2336)
| v3_struct_0(X2336)
| v1_pre_topc(k11_lopclset(X2336)) )
& ( ~ l3_lattices(X2336)
| v3_realset2(X2336)
| ~ v17_lattices(X2336)
| ~ v10_lattices(X2336)
| v3_struct_0(X2336)
| ~ v3_struct_0(k11_lopclset(X2336)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| ~ v17_lattices(X1)
| ~ l1_pre_topc(k11_lopclset(X1))
| ~ v2_pre_topc(k11_lopclset(X1))
| ~ r1_filter_1(esk1_0,k12_lopclset(X1))
| v3_struct_0(X1)
| v3_realset2(X1)
| v3_struct_0(k11_lopclset(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| r1_filter_1(X1,k12_lopclset(X1))
| v3_realset2(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| v3_realset2(X1)
| v3_struct_0(X1)
| v2_pre_topc(k11_lopclset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| v3_realset2(X1)
| v3_struct_0(X1)
| l1_pre_topc(k11_lopclset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ l3_lattices(X1)
| ~ v17_lattices(X1)
| ~ v10_lattices(X1)
| ~ v3_struct_0(k11_lopclset(X1))
| v3_realset2(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ v3_realset2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
v17_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_18,c_0_19,c_0_20,c_0_21,c_0_22,c_0_23,c_0_24,c_0_25,c_0_26,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT292+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n011.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Sun Sep 20 23:28:11 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 68.10/11.28 % Version: 3.5.1
% 68.10/11.28 % Preprocessing class: FMLLSMLLSSSNFFN.
% 68.10/11.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.10/11.28 % Starting new_bool_3 with 900s (3) cores
% 68.10/11.28 % Starting new_bool_1 with 900s (3) cores
% 68.10/11.28 % Starting sh5l with 300s (1) cores
% 68.10/11.28 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 68.10/11.28 % new_bool_3 with pid 422307 completed with status 0
% 68.10/11.28 % Result found by new_bool_3
% 68.10/11.28 % Preprocessing class: FMLLSMLLSSSNFFN.
% 68.10/11.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.10/11.28 % Starting new_bool_3 with 900s (3) cores
% 68.10/11.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 68.10/11.28 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 68.10/11.28 % Search class: FGHSM-SMLM32-MFFFFFNN
% 68.10/11.28 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 68.10/11.28 % Starting SubtermCWHack with 82s (1) cores
% 68.10/11.28 % Starting new_bool_3 with 91s (1) cores
% 68.10/11.28 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 68.10/11.28 % new_bool_3 with pid 422313 completed with status 0
% 68.10/11.28 % Result found by new_bool_3
% 68.10/11.28 % Preprocessing class: FMLLSMLLSSSNFFN.
% 68.10/11.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.10/11.28 % Starting new_bool_3 with 900s (3) cores
% 68.10/11.28 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 68.10/11.28 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 68.10/11.28 % Search class: FGHSM-SMLM32-MFFFFFNN
% 68.10/11.28 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 68.10/11.28 % Starting SubtermCWHack with 82s (1) cores
% 68.10/11.28 % Starting new_bool_3 with 91s (1) cores
% 68.10/11.28 % Preprocessing time : 0.123 s
% 68.10/11.28 % Presaturation interreduction done
% 68.10/11.28 % SatCheck found unsatisfiable ground set
% 68.10/11.28
% 68.10/11.28 % Proof found!
% 68.10/11.28 % SZS status Theorem
% 68.10/11.28 % SZS output start CNFRefutation
% See solution above
% 68.10/11.28 % Parsed axioms : 12412
% 68.10/11.28 % Removed by relevancy pruning/SinE : 10884
% 68.10/11.28 % Initial clauses : 3382
% 68.10/11.28 % Removed in clause preprocessing : 142
% 68.10/11.28 % Initial clauses in saturation : 3240
% 68.10/11.28 % Processed clauses : 28222
% 68.10/11.28 % ...of these trivial : 747
% 68.10/11.28 % ...subsumed : 17475
% 68.10/11.28 % ...remaining for further processing : 10000
% 68.10/11.28 % Other redundant clauses eliminated : 1052
% 68.10/11.28 % Clauses deleted for lack of memory : 0
% 68.10/11.28 % Backward-subsumed : 94
% 68.10/11.28 % Backward-rewritten : 76
% 68.10/11.28 % Generated clauses : 143416
% 68.10/11.28 % ...of the previous two non-redundant : 122769
% 68.10/11.28 % ...aggressively subsumed : 0
% 68.10/11.28 % Contextual simplify-reflections : 197
% 68.10/11.28 % Paramodulations : 142315
% 68.10/11.28 % Factorizations : 29
% 68.10/11.28 % NegExts : 0
% 68.10/11.28 % Equation resolutions : 1093
% 68.10/11.28 % Disequality decompositions : 0
% 68.10/11.28 % Total rewrite steps : 36134
% 68.10/11.28 % ...of those cached : 32294
% 68.10/11.28 % Propositional unsat checks : 2
% 68.10/11.28 % Propositional check models : 1
% 68.10/11.28 % Propositional check unsatisfiable : 1
% 68.10/11.28 % Propositional clauses : 107159
% 68.10/11.28 % Propositional clauses after purity: 8747
% 68.10/11.28 % Propositional unsat core size : 10
% 68.10/11.28 % Propositional preprocessing time : 0.000
% 68.10/11.28 % Propositional encoding time : 0.312
% 68.10/11.28 % Propositional solver time : 0.069
% 68.10/11.28 % Success case prop preproc time : 0.000
% 68.10/11.28 % Success case prop encoding time : 0.269
% 68.10/11.28 % Success case prop solver time : 0.034
% 68.10/11.28 % Current number of processed clauses : 6626
% 68.10/11.28 % Positive orientable unit clauses : 1460
% 68.10/11.28 % Positive unorientable unit clauses: 2
% 68.10/11.28 % Negative unit clauses : 1658
% 68.10/11.28 % Non-unit-clauses : 3506
% 68.10/11.28 % Current number of unprocessed clauses: 100533
% 68.10/11.28 % ...number of literals in the above : 386802
% 68.10/11.28 % Current number of archived formulas : 0
% 68.10/11.28 % Current number of archived clauses : 3164
% 68.10/11.28 % Clause-clause subsumption calls (NU) : 11428620
% 68.10/11.28 % Rec. Clause-clause subsumption calls : 1481088
% 68.10/11.28 % Non-unit clause-clause subsumptions : 2508
% 68.10/11.28 % Unit Clause-clause subsumption calls : 1193849
% 68.10/11.28 % Rewrite failures with RHS unbound : 0
% 68.10/11.28 % BW rewrite match attempts : 470
% 68.10/11.28 % BW rewrite match successes : 205
% 68.10/11.28 % Condensation attempts : 0
% 68.10/11.28 % Condensation successes : 0
% 68.10/11.28 % Termbank termtop insertions : 3231909
% 68.10/11.28 % Search garbage collected termcells : 154532
% 68.10/11.28
% 68.10/11.28 % -------------------------------------------------
% 68.10/11.28 % User time : 9.558 s
% 68.10/11.28 % System time : 0.257 s
% 68.10/11.28 % Total time : 9.815 s
% 68.10/11.28 % Maximum resident set size: 30784 pages
% 68.10/11.28
% 68.10/11.28 % -------------------------------------------------
% 68.10/11.28 % User time : 28.444 s
% 68.10/11.28 % System time : 0.672 s
% 68.10/11.28 % Total time : 29.115 s
% 68.10/11.28 % Maximum resident set size: 20992 pages
% 68.10/11.28 % E exiting
%------------------------------------------------------------------------------