%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT300+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:04:47 PM UTC 2026
% Result : Theorem 1.28s 1.80s
% Output : CNFRefutation 2.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 146 ( 52 ~; 41 |; 30 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 52 ( 1 sgn 33 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t24_filter_2,conjecture,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( r2_hidden(X3,X2)
& m1_subset_1(X3,u1_struct_0(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_filter_2) ).
fof(dt_m2_filter_2,axiom,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( m2_lattice4(X2,X1)
& ~ v1_xboole_0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_filter_2) ).
fof(dt_m2_lattice4,axiom,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+375.ax',dt_m2_lattice4) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( m1_subset_1(X2,k1_zfmisc_1(X3))
& r2_hidden(X1,X2) )
=> m1_subset_1(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t4_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',existence_m1_subset_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( r2_hidden(X3,X2)
& m1_subset_1(X3,u1_struct_0(X1)) ) ) ),
inference(assume_negation,[status(cth)],[t24_filter_2]) ).
fof(c_0_7,plain,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ( m2_lattice4(X2,X1)
& ~ v1_xboole_0(X2) ) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_filter_2]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_filter_2(X2,X1)
=> ? [X3] :
( r2_hidden(X3,X2)
& m1_subset_1(X3,u1_struct_0(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X1] :
( ( l3_lattices(X1)
& v10_lattices(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m2_lattice4(X2,X1)
=> m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(fof_simplification,[status(thm)],[dt_m2_lattice4]) ).
fof(c_0_10,plain,
! [X72,X73] :
( ( ~ l3_lattices(X72)
| ~ v10_lattices(X72)
| v3_struct_0(X72)
| ~ m2_filter_2(X73,X72)
| m2_lattice4(X73,X72) )
& ( ~ l3_lattices(X72)
| ~ v10_lattices(X72)
| v3_struct_0(X72)
| ~ m2_filter_2(X73,X72)
| ~ v1_xboole_0(X73) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_11,negated_conjecture,
! [X17] :
( ( ~ r2_hidden(X17,esk2_0)
| ~ m1_subset_1(X17,u1_struct_0(esk1_0)) )
& m2_filter_2(esk2_0,esk1_0)
& l3_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_8])])])])]) ).
fof(c_0_12,plain,
! [X121,X122] :
( m1_subset_1(X122,k1_zfmisc_1(u1_struct_0(X121)))
| ~ m2_lattice4(X122,X121)
| ~ l3_lattices(X121)
| ~ v10_lattices(X121)
| v3_struct_0(X121) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_13,plain,
( ~ l3_lattices(X2)
| ~ v10_lattices(X2)
| ~ m2_filter_2(X1,X2)
| v3_struct_0(X2)
| m2_lattice4(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
m2_filter_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X1,X2] :
( ( v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> v1_xboole_0(X2) ) )
& ( ~ v1_xboole_0(X1)
=> ( m1_subset_1(X2,X1)
<=> r2_hidden(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_19,plain,
! [X46,X47,X48] :
( m1_subset_1(X46,X48)
| ~ m1_subset_1(X47,k1_zfmisc_1(X48))
| ~ r2_hidden(X46,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_20,plain,
( ~ m2_lattice4(X2,X1)
| ~ l3_lattices(X1)
| ~ v10_lattices(X1)
| m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
m2_lattice4(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
fof(c_0_22,plain,
! [X29,X30] :
( ( ~ v1_xboole_0(X29)
| m1_subset_1(X30,X29)
| ~ v1_xboole_0(X30) )
& ( ~ v1_xboole_0(X29)
| v1_xboole_0(X30)
| ~ m1_subset_1(X30,X29) )
& ( v1_xboole_0(X29)
| m1_subset_1(X30,X29)
| ~ r2_hidden(X30,X29) )
& ( v1_xboole_0(X29)
| r2_hidden(X30,X29)
| ~ m1_subset_1(X30,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
fof(c_0_23,plain,
! [X70] : m1_subset_1(esk8_1(X70),X70),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_24,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(X3))
| ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| ~ m1_subset_1(X1,u1_struct_0(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( ~ m1_subset_1(X1,X2)
| v1_xboole_0(X2)
| r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
m1_subset_1(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ~ l3_lattices(X2)
| ~ v10_lattices(X2)
| ~ m2_filter_2(X1,X2)
| ~ v1_xboole_0(X1)
| v3_struct_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
~ r2_hidden(X1,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
( r2_hidden(esk8_1(X1),X1)
| v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ v1_xboole_0(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT300+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n003.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 20 23:32:17 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.28/1.80 % Version: 3.5.1
% 1.28/1.80 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.28/1.80 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.28/1.80 % Starting new_bool_3 with 897s (3) cores
% 1.28/1.80 % Starting new_bool_1 with 897s (3) cores
% 1.28/1.80 % Starting sh5l with 299s (1) cores
% 1.28/1.80 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 1.28/1.80 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 2858266 completed with status 0
% 1.28/1.80 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 1.28/1.80 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.28/1.80 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.28/1.80 % Starting new_bool_3 with 897s (3) cores
% 1.28/1.80 % Starting new_bool_1 with 897s (3) cores
% 1.28/1.80 % Starting sh5l with 299s (1) cores
% 1.28/1.80 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 1.28/1.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.28/1.80 % SinE strategy is gf120_gu_R02_F100_L20000
% 1.28/1.80 % Search class: FGHSS-FSLM31-MFFFFFNN
% 1.28/1.80 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.28/1.80 % Scheduled 8 strats onto 1 cores with 299 seconds (299 total)
% 1.28/1.80 % Starting SubtermCWHack with 27s (1) cores
% 1.28/1.80 % SubtermCWHack with pid 2858271 completed with status 0
% 1.28/1.80 % Result found by SubtermCWHack
% 1.28/1.80 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.28/1.80 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.28/1.80 % Starting new_bool_3 with 897s (3) cores
% 1.28/1.80 % Starting new_bool_1 with 897s (3) cores
% 1.28/1.80 % Starting sh5l with 299s (1) cores
% 1.28/1.80 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 1.28/1.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.28/1.80 % SinE strategy is gf120_gu_R02_F100_L20000
% 1.28/1.80 % Search class: FGHSS-FSLM31-MFFFFFNN
% 1.28/1.80 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.28/1.80 % Scheduled 8 strats onto 1 cores with 299 seconds (299 total)
% 1.28/1.80 % Starting SubtermCWHack with 27s (1) cores
% 1.28/1.80 % Preprocessing time : 0.011 s
% 1.28/1.80
% 1.28/1.80 % Proof found!
% 1.28/1.80 % SZS status Theorem
% 1.28/1.80 % SZS output start CNFRefutation
% See solution above
% 2.57/1.80 % Parsed axioms : 13607
% 2.57/1.80 % Removed by relevancy pruning/SinE : 13546
% 2.57/1.80 % Initial clauses : 191
% 2.57/1.80 % Removed in clause preprocessing : 0
% 2.57/1.80 % Initial clauses in saturation : 191
% 2.57/1.80 % Processed clauses : 150
% 2.57/1.80 % ...of these trivial : 0
% 2.57/1.80 % ...subsumed : 52
% 2.57/1.80 % ...remaining for further processing : 98
% 2.57/1.80 % Other redundant clauses eliminated : 0
% 2.57/1.80 % Clauses deleted for lack of memory : 0
% 2.57/1.80 % Backward-subsumed : 4
% 2.57/1.80 % Backward-rewritten : 5
% 2.57/1.80 % Generated clauses : 255
% 2.57/1.80 % ...of the previous two non-redundant : 203
% 2.57/1.80 % ...aggressively subsumed : 0
% 2.57/1.80 % Contextual simplify-reflections : 1
% 2.57/1.80 % Paramodulations : 255
% 2.57/1.80 % Factorizations : 0
% 2.57/1.80 % NegExts : 0
% 2.57/1.80 % Equation resolutions : 0
% 2.57/1.80 % Disequality decompositions : 0
% 2.57/1.80 % Total rewrite steps : 47
% 2.57/1.80 % ...of those cached : 34
% 2.57/1.80 % Propositional unsat checks : 0
% 2.57/1.80 % Propositional check models : 0
% 2.57/1.80 % Propositional check unsatisfiable : 0
% 2.57/1.80 % Propositional clauses : 0
% 2.57/1.80 % Propositional clauses after purity: 0
% 2.57/1.80 % Propositional unsat core size : 0
% 2.57/1.80 % Propositional preprocessing time : 0.000
% 2.57/1.80 % Propositional encoding time : 0.000
% 2.57/1.80 % Propositional solver time : 0.000
% 2.57/1.80 % Success case prop preproc time : 0.000
% 2.57/1.80 % Success case prop encoding time : 0.000
% 2.57/1.80 % Success case prop solver time : 0.000
% 2.57/1.80 % Current number of processed clauses : 89
% 2.57/1.80 % Positive orientable unit clauses : 18
% 2.57/1.80 % Positive unorientable unit clauses: 0
% 2.57/1.80 % Negative unit clauses : 7
% 2.57/1.80 % Non-unit-clauses : 64
% 2.57/1.80 % Current number of unprocessed clauses: 241
% 2.57/1.80 % ...number of literals in the above : 1204
% 2.57/1.80 % Current number of archived formulas : 0
% 2.57/1.80 % Current number of archived clauses : 9
% 2.57/1.80 % Clause-clause subsumption calls (NU) : 1573
% 2.57/1.80 % Rec. Clause-clause subsumption calls : 1248
% 2.57/1.80 % Non-unit clause-clause subsumptions : 45
% 2.57/1.80 % Unit Clause-clause subsumption calls : 157
% 2.57/1.80 % Rewrite failures with RHS unbound : 0
% 2.57/1.80 % BW rewrite match attempts : 3
% 2.57/1.80 % BW rewrite match successes : 3
% 2.57/1.80 % Condensation attempts : 0
% 2.57/1.80 % Condensation successes : 0
% 2.57/1.80 % Termbank termtop insertions : 350910
% 2.57/1.80 % Search garbage collected termcells : 120091
% 2.57/1.80
% 2.57/1.80 % -------------------------------------------------
% 2.57/1.80 % User time : 0.155 s
% 2.57/1.80 % System time : 0.051 s
% 2.57/1.80 % Total time : 0.207 s
% 2.57/1.80 % Maximum resident set size: 27892 pages
% 2.57/1.80
% 2.57/1.80 % -------------------------------------------------
% 2.57/1.80 % User time : 1.142 s
% 2.57/1.80 % System time : 0.097 s
% 2.57/1.80 % Total time : 1.238 s
% 2.57/1.80 % Maximum resident set size: 23040 pages
% 2.57/1.80 % E exiting
%------------------------------------------------------------------------------