%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT300+2 : 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 : n016.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:46 PM UTC 2026
% Result : Theorem 1.03s 0.81s
% Output : CNFRefutation 1.03s
% 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,
! [X62,X63] :
( ( ~ l3_lattices(X62)
| ~ v10_lattices(X62)
| v3_struct_0(X62)
| ~ m2_filter_2(X63,X62)
| m2_lattice4(X63,X62) )
& ( ~ l3_lattices(X62)
| ~ v10_lattices(X62)
| v3_struct_0(X62)
| ~ m2_filter_2(X63,X62)
| ~ v1_xboole_0(X63) ) ),
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,
! [X16] :
( ( ~ r2_hidden(X16,esk2_0)
| ~ m1_subset_1(X16,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,
! [X183,X184] :
( m1_subset_1(X184,k1_zfmisc_1(u1_struct_0(X183)))
| ~ m2_lattice4(X184,X183)
| ~ l3_lattices(X183)
| ~ v10_lattices(X183)
| v3_struct_0(X183) ),
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,
! [X271,X272,X273] :
( m1_subset_1(X271,X273)
| ~ m1_subset_1(X272,k1_zfmisc_1(X273))
| ~ r2_hidden(X271,X272) ),
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,
! [X34,X35] :
( ( ~ v1_xboole_0(X34)
| m1_subset_1(X35,X34)
| ~ v1_xboole_0(X35) )
& ( ~ v1_xboole_0(X34)
| v1_xboole_0(X35)
| ~ m1_subset_1(X35,X34) )
& ( v1_xboole_0(X34)
| m1_subset_1(X35,X34)
| ~ r2_hidden(X35,X34) )
& ( v1_xboole_0(X34)
| r2_hidden(X35,X34)
| ~ m1_subset_1(X35,X34) ) ),
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,
! [X60] : m1_subset_1(esk6_1(X60),X60),
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(esk6_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(esk6_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.04 % Problem : LAT300+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 % Computer : n016.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Sun Sep 20 23:35:10 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.49 Running first-order theorem proving
% 0.25/0.49 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.03/0.81 % Version: 3.5.1
% 1.03/0.81 % Preprocessing class: FMLMSMSLSSSNFFN.
% 1.03/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.81 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1.03/0.81 % Starting new_bool_3 with 600s (2) cores
% 1.03/0.81 % Starting new_bool_1 with 600s (2) cores
% 1.03/0.81 % Starting sh5l with 300s (1) cores
% 1.03/0.81 % new_bool_3 with pid 1037305 completed with status 0
% 1.03/0.81 % Result found by new_bool_3
% 1.03/0.81 % Preprocessing class: FMLMSMSLSSSNFFN.
% 1.03/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.81 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1.03/0.81 % Starting new_bool_3 with 600s (2) cores
% 1.03/0.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.03/0.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.81 % Search class: FGHSM-FSLM31-MFFFFFNN
% 1.03/0.81 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 1.03/0.81 % Starting SubtermCWHack with 55s (1) cores
% 1.03/0.81 % Starting new_bool_3 with 61s (1) cores
% 1.03/0.81 % SubtermCWHack with pid 1037308 completed with status 0
% 1.03/0.81 % Result found by SubtermCWHack
% 1.03/0.81 % Preprocessing class: FMLMSMSLSSSNFFN.
% 1.03/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.81 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 1.03/0.81 % Starting new_bool_3 with 600s (2) cores
% 1.03/0.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.03/0.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.03/0.81 % Search class: FGHSM-FSLM31-MFFFFFNN
% 1.03/0.81 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 1.03/0.81 % Starting SubtermCWHack with 55s (1) cores
% 1.03/0.81 % Preprocessing time : 0.016 s
% 1.03/0.81
% 1.03/0.81 % Proof found!
% 1.03/0.81 % SZS status Theorem
% 1.03/0.81 % SZS output start CNFRefutation
% See solution above
% 1.03/0.81 % Parsed axioms : 2948
% 1.03/0.81 % Removed by relevancy pruning/SinE : 2708
% 1.03/0.81 % Initial clauses : 546
% 1.03/0.81 % Removed in clause preprocessing : 14
% 1.03/0.81 % Initial clauses in saturation : 532
% 1.03/0.81 % Processed clauses : 1247
% 1.03/0.81 % ...of these trivial : 3
% 1.03/0.81 % ...subsumed : 733
% 1.03/0.81 % ...remaining for further processing : 511
% 1.03/0.81 % Other redundant clauses eliminated : 25
% 1.03/0.81 % Clauses deleted for lack of memory : 0
% 1.03/0.81 % Backward-subsumed : 15
% 1.03/0.81 % Backward-rewritten : 11
% 1.03/0.81 % Generated clauses : 2089
% 1.03/0.81 % ...of the previous two non-redundant : 1753
% 1.03/0.81 % ...aggressively subsumed : 0
% 1.03/0.81 % Contextual simplify-reflections : 2
% 1.03/0.81 % Paramodulations : 2060
% 1.03/0.81 % Factorizations : 1
% 1.03/0.81 % NegExts : 0
% 1.03/0.81 % Equation resolutions : 29
% 1.03/0.81 % Disequality decompositions : 0
% 1.03/0.81 % Total rewrite steps : 574
% 1.03/0.81 % ...of those cached : 492
% 1.03/0.81 % Propositional unsat checks : 0
% 1.03/0.81 % Propositional check models : 0
% 1.03/0.81 % Propositional check unsatisfiable : 0
% 1.03/0.81 % Propositional clauses : 0
% 1.03/0.81 % Propositional clauses after purity: 0
% 1.03/0.81 % Propositional unsat core size : 0
% 1.03/0.81 % Propositional preprocessing time : 0.000
% 1.03/0.81 % Propositional encoding time : 0.000
% 1.03/0.81 % Propositional solver time : 0.000
% 1.03/0.81 % Success case prop preproc time : 0.000
% 1.03/0.81 % Success case prop encoding time : 0.000
% 1.03/0.81 % Success case prop solver time : 0.000
% 1.03/0.81 % Current number of processed clauses : 471
% 1.03/0.81 % Positive orientable unit clauses : 104
% 1.03/0.81 % Positive unorientable unit clauses: 0
% 1.03/0.81 % Negative unit clauses : 84
% 1.03/0.81 % Non-unit-clauses : 283
% 1.03/0.81 % Current number of unprocessed clauses: 1002
% 1.03/0.81 % ...number of literals in the above : 3836
% 1.03/0.81 % Current number of archived formulas : 0
% 1.03/0.81 % Current number of archived clauses : 26
% 1.03/0.81 % Clause-clause subsumption calls (NU) : 20793
% 1.03/0.81 % Rec. Clause-clause subsumption calls : 11876
% 1.03/0.81 % Non-unit clause-clause subsumptions : 243
% 1.03/0.81 % Unit Clause-clause subsumption calls : 2137
% 1.03/0.81 % Rewrite failures with RHS unbound : 0
% 1.03/0.81 % BW rewrite match attempts : 22
% 1.03/0.81 % BW rewrite match successes : 8
% 1.03/0.81 % Condensation attempts : 0
% 1.03/0.81 % Condensation successes : 0
% 1.03/0.81 % Termbank termtop insertions : 111976
% 1.03/0.81 % Search garbage collected termcells : 28237
% 1.03/0.81
% 1.03/0.81 % -------------------------------------------------
% 1.03/0.81 % User time : 0.122 s
% 1.03/0.81 % System time : 0.019 s
% 1.03/0.81 % Total time : 0.142 s
% 1.03/0.81 % Maximum resident set size: 8860 pages
% 1.03/0.81
% 1.03/0.81 % -------------------------------------------------
% 1.03/0.81 % User time : 0.353 s
% 1.03/0.81 % System time : 0.044 s
% 1.03/0.81 % Total time : 0.397 s
% 1.03/0.81 % Maximum resident set size: 8448 pages
% 1.03/0.81 % E exiting
%------------------------------------------------------------------------------