%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT300+4 : 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 : 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 : Thu Sep 24 01:04:47 PM UTC 2026
% Result : Theorem 0.86s 1.45s
% Output : CNFRefutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 12 unt; 0 def)
% Number of atoms : 149 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 166 ( 59 ~; 49 |; 33 &)
% ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 63 ( 1 sgn 36 !; 6 ?)
% 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/sandbox/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/sandbox/benchmark/theBenchmark.p',dt_m2_filter_2) ).
fof(rc1_subset_1,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ? [X2] :
( ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',rc1_subset_1) ).
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/sandbox/benchmark/Axioms/SET007/SET007+7.ax',d2_subset_1) ).
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/sandbox/benchmark/Axioms/SET007/SET007+375.ax',dt_m2_lattice4) ).
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/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t4_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : m1_subset_1(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+7.ax',existence_m1_subset_1) ).
fof(c_0_7,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_8,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_9,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_7]) ).
fof(c_0_10,plain,
! [X1] :
( ~ v1_xboole_0(X1)
=> ? [X2] :
( ~ v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) ) ),
inference(fof_simplification,[status(thm)],[rc1_subset_1]) ).
fof(c_0_11,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_12,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_13,plain,
! [X92,X93] :
( ( ~ l3_lattices(X92)
| ~ v10_lattices(X92)
| v3_struct_0(X92)
| ~ m2_filter_2(X93,X92)
| m2_lattice4(X93,X92) )
& ( ~ l3_lattices(X92)
| ~ v10_lattices(X92)
| v3_struct_0(X92)
| ~ m2_filter_2(X93,X92)
| ~ v1_xboole_0(X93) ) ),
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_8])])])])]) ).
fof(c_0_14,negated_conjecture,
! [X54] :
( ( ~ r2_hidden(X54,esk2_0)
| ~ m1_subset_1(X54,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_9])])])])]) ).
fof(c_0_15,plain,
! [X228,X229,X230] :
( m1_subset_1(X228,X230)
| ~ m1_subset_1(X229,k1_zfmisc_1(X230))
| ~ r2_hidden(X228,X229) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_16,plain,
! [X204] :
( ( v1_xboole_0(X204)
| ~ v1_xboole_0(esk32_1(X204)) )
& ( v1_xboole_0(X204)
| m1_subset_1(esk32_1(X204),k1_zfmisc_1(X204)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_17,plain,
! [X66,X67] :
( ( ~ v1_xboole_0(X66)
| m1_subset_1(X67,X66)
| ~ v1_xboole_0(X67) )
& ( ~ v1_xboole_0(X66)
| v1_xboole_0(X67)
| ~ m1_subset_1(X67,X66) )
& ( v1_xboole_0(X66)
| m1_subset_1(X67,X66)
| ~ r2_hidden(X67,X66) )
& ( v1_xboole_0(X66)
| r2_hidden(X67,X66)
| ~ m1_subset_1(X67,X66) ) ),
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_18,plain,
! [X90] : m1_subset_1(esk5_1(X90),X90),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_19,plain,
! [X133,X134] :
( m1_subset_1(X134,k1_zfmisc_1(u1_struct_0(X133)))
| ~ m2_lattice4(X134,X133)
| ~ l3_lattices(X133)
| ~ v10_lattices(X133)
| v3_struct_0(X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_20,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_13]) ).
cnf(c_0_21,negated_conjecture,
m2_filter_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
v10_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
l3_lattices(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,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_15]) ).
cnf(c_0_26,plain,
( v1_xboole_0(X1)
| m1_subset_1(esk32_1(X1),k1_zfmisc_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
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_17]) ).
cnf(c_0_28,plain,
m1_subset_1(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,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_19]) ).
cnf(c_0_30,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_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_31,plain,
( ~ r2_hidden(X1,esk32_1(X2))
| v1_xboole_0(X2)
| m1_subset_1(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( r2_hidden(esk5_1(X1),X1)
| v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( ~ v1_xboole_0(esk32_1(X1))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,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_29,c_0_30]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| ~ m1_subset_1(X1,u1_struct_0(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_36,plain,
( v1_xboole_0(X1)
| m1_subset_1(esk5_1(esk32_1(X1)),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,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_13]) ).
cnf(c_0_38,negated_conjecture,
~ r2_hidden(X1,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
( r2_hidden(esk5_1(esk32_1(X1)),X1)
| v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_40,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_37,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LAT300+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 20 23:30:33 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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
% 0.86/1.45 % Version: 3.5.1
% 0.86/1.45 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.86/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/1.45 % Starting new_bool_3 with 900s (3) cores
% 0.86/1.45 % Starting new_bool_1 with 900s (3) cores
% 0.86/1.45 % Starting sh5l with 300s (1) cores
% 0.86/1.45 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 0.86/1.45 % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 1084011 completed with status 0
% 0.86/1.45 % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.86/1.45 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.86/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/1.45 % Starting new_bool_3 with 900s (3) cores
% 0.86/1.45 % Starting new_bool_1 with 900s (3) cores
% 0.86/1.45 % Starting sh5l with 300s (1) cores
% 0.86/1.45 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 0.86/1.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.86/1.45 % SinE strategy is gf120_h_gu_R02_F100_L20000
% 0.86/1.45 % Search class: FGHSS-FSLM31-MFFFFFNN
% 0.86/1.45 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.86/1.45 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.86/1.45 % Starting SubtermCWHack with 28s (1) cores
% 0.86/1.45 % SubtermCWHack with pid 1084018 completed with status 0
% 0.86/1.45 % Result found by SubtermCWHack
% 0.86/1.45 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.86/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.86/1.45 % Starting new_bool_3 with 900s (3) cores
% 0.86/1.45 % Starting new_bool_1 with 900s (3) cores
% 0.86/1.45 % Starting sh5l with 300s (1) cores
% 0.86/1.45 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 300s (1) cores
% 0.86/1.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.86/1.45 % SinE strategy is gf120_h_gu_R02_F100_L20000
% 0.86/1.45 % Search class: FGHSS-FSLM31-MFFFFFNN
% 0.86/1.45 % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.86/1.45 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.86/1.45 % Starting SubtermCWHack with 28s (1) cores
% 0.86/1.45 % Preprocessing time : 0.012 s
% 0.86/1.45
% 0.86/1.45 % Proof found!
% 0.86/1.45 % SZS status Theorem
% 0.86/1.45 % SZS output start CNFRefutation
% See solution above
% 0.86/1.45 % Parsed axioms : 34682
% 0.86/1.45 % Removed by relevancy pruning/SinE : 34602
% 0.86/1.45 % Initial clauses : 214
% 0.86/1.45 % Removed in clause preprocessing : 2
% 0.86/1.45 % Initial clauses in saturation : 212
% 0.86/1.45 % Processed clauses : 217
% 0.86/1.45 % ...of these trivial : 0
% 0.86/1.45 % ...subsumed : 90
% 0.86/1.45 % ...remaining for further processing : 127
% 0.86/1.45 % Other redundant clauses eliminated : 0
% 0.86/1.45 % Clauses deleted for lack of memory : 0
% 0.86/1.45 % Backward-subsumed : 10
% 0.86/1.45 % Backward-rewritten : 2
% 0.86/1.45 % Generated clauses : 439
% 0.86/1.45 % ...of the previous two non-redundant : 354
% 0.86/1.45 % ...aggressively subsumed : 0
% 0.86/1.45 % Contextual simplify-reflections : 5
% 0.86/1.45 % Paramodulations : 439
% 0.86/1.45 % Factorizations : 0
% 0.86/1.45 % NegExts : 0
% 0.86/1.45 % Equation resolutions : 0
% 0.86/1.45 % Disequality decompositions : 0
% 0.86/1.45 % Total rewrite steps : 51
% 0.86/1.45 % ...of those cached : 39
% 0.86/1.45 % Propositional unsat checks : 0
% 0.86/1.45 % Propositional check models : 0
% 0.86/1.45 % Propositional check unsatisfiable : 0
% 0.86/1.45 % Propositional clauses : 0
% 0.86/1.45 % Propositional clauses after purity: 0
% 0.86/1.45 % Propositional unsat core size : 0
% 0.86/1.45 % Propositional preprocessing time : 0.000
% 0.86/1.45 % Propositional encoding time : 0.000
% 0.86/1.45 % Propositional solver time : 0.000
% 0.86/1.45 % Success case prop preproc time : 0.000
% 0.86/1.45 % Success case prop encoding time : 0.000
% 0.86/1.45 % Success case prop solver time : 0.000
% 0.86/1.45 % Current number of processed clauses : 115
% 0.86/1.45 % Positive orientable unit clauses : 15
% 0.86/1.45 % Positive unorientable unit clauses: 0
% 0.86/1.45 % Negative unit clauses : 10
% 0.86/1.45 % Non-unit-clauses : 90
% 0.86/1.45 % Current number of unprocessed clauses: 339
% 0.86/1.45 % ...number of literals in the above : 1614
% 0.86/1.45 % Current number of archived formulas : 0
% 0.86/1.45 % Current number of archived clauses : 12
% 0.86/1.45 % Clause-clause subsumption calls (NU) : 3417
% 0.86/1.45 % Rec. Clause-clause subsumption calls : 2328
% 0.86/1.45 % Non-unit clause-clause subsumptions : 71
% 0.86/1.45 % Unit Clause-clause subsumption calls : 189
% 0.86/1.45 % Rewrite failures with RHS unbound : 0
% 0.86/1.45 % BW rewrite match attempts : 1
% 0.86/1.45 % BW rewrite match successes : 1
% 0.86/1.45 % Condensation attempts : 0
% 0.86/1.45 % Condensation successes : 0
% 0.86/1.45 % Termbank termtop insertions : 1050732
% 0.86/1.45 % Search garbage collected termcells : 345371
% 0.86/1.45
% 0.86/1.45 % -------------------------------------------------
% 0.86/1.45 % User time : 0.215 s
% 0.86/1.45 % System time : 0.076 s
% 0.86/1.45 % Total time : 0.291 s
% 0.86/1.45 % Maximum resident set size: 70340 pages
% 0.86/1.45
% 0.86/1.45 % -------------------------------------------------
% 0.86/1.45 % User time : 0.948 s
% 0.86/1.45 % System time : 0.136 s
% 0.86/1.45 % Total time : 1.084 s
% 0.86/1.45 % Maximum resident set size: 57088 pages
% 0.86/1.45 % E exiting
%------------------------------------------------------------------------------