%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT286+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 : n026.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:41 PM UTC 2026
% Result : Theorem 21.66s 4.12s
% Output : CNFRefutation 21.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 117 ( 4 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 135 ( 53 ~; 39 |; 28 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 1 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_lopclset,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_lopclset) ).
fof(redefinition_m2_subset_1,axiom,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X2)
& ~ v1_xboole_0(X1) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',redefinition_m2_subset_1) ).
fof(t8_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_lopclset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',fc1_subset_1) ).
fof(t13_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_lopclset) ).
fof(dt_k1_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_lopclset) ).
fof(fc1_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_lopclset) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(assume_negation,[status(cth)],[t15_lopclset]) ).
fof(c_0_8,plain,
! [X1,X2] :
( ( m1_subset_1(X2,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X2)
& ~ v1_xboole_0(X1) )
=> ! [X3] :
( m2_subset_1(X3,X1,X2)
<=> m1_subset_1(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[redefinition_m2_subset_1]) ).
fof(c_0_9,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[t8_lopclset]) ).
fof(c_0_10,plain,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k2_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1) ),
inference(fof_simplification,[status(thm)],[t13_lopclset]) ).
fof(c_0_13,plain,
! [X939,X940,X941] :
( ( ~ m1_subset_1(X940,k1_zfmisc_1(X939))
| v1_xboole_0(X940)
| v1_xboole_0(X939)
| m2_subset_1(X941,X939,X940)
| ~ m1_subset_1(X941,X940) )
& ( ~ m1_subset_1(X940,k1_zfmisc_1(X939))
| v1_xboole_0(X940)
| v1_xboole_0(X939)
| m1_subset_1(X941,X940)
| ~ m2_subset_1(X941,X939,X940) ) ),
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,plain,
! [X57] :
( m2_subset_1(k2_pre_topc(X57),k1_zfmisc_1(u1_struct_0(X57)),k1_lopclset(X57))
| ~ l1_pre_topc(X57)
| ~ v2_pre_topc(X57)
| v3_struct_0(X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_15,plain,
! [X471] : ~ v1_xboole_0(k1_zfmisc_1(X471)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_16,plain,
! [X1] :
( ( l1_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1)))) ),
inference(fof_simplification,[status(thm)],[dt_k1_lopclset]) ).
fof(c_0_17,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ~ v1_xboole_0(k1_lopclset(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lopclset]) ).
fof(c_0_18,negated_conjecture,
( ~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0)))
& l1_pre_topc(esk1_0)
& v2_pre_topc(esk1_0)
& ~ v3_struct_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_19,plain,
! [X24] :
( u1_struct_0(k6_lopclset(X24)) = k1_lopclset(X24)
| ~ l1_pre_topc(X24)
| ~ v2_pre_topc(X24)
| v3_struct_0(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_20,plain,
( ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ m2_subset_1(X1,X2,X3)
| v1_xboole_0(X3)
| v1_xboole_0(X2)
| m1_subset_1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| m2_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1)),k1_lopclset(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X113] :
( m1_subset_1(k1_lopclset(X113),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X113))))
| ~ l1_pre_topc(X113)
| v3_struct_0(X113) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_24,plain,
! [X114] :
( ~ v1_xboole_0(k1_lopclset(X114))
| ~ l1_pre_topc(X114)
| ~ v2_pre_topc(X114)
| v3_struct_0(X114) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_25,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| u1_struct_0(k6_lopclset(X1)) = k1_lopclset(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| v3_struct_0(X1)
| v1_xboole_0(k1_lopclset(X1))
| m1_subset_1(k2_pre_topc(X1),k1_lopclset(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_31,plain,
( ~ l1_pre_topc(X1)
| m1_subset_1(k1_lopclset(X1),k1_zfmisc_1(k1_zfmisc_1(u1_struct_0(X1))))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( ~ v1_xboole_0(k1_lopclset(X1))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_34,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_30,c_0_31,c_0_32,c_0_33,c_0_29,c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT286+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.58 % Computer : n026.cluster.edu
% 0.09/0.58 % Model : x86_64 x86_64
% 0.09/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58 % Memory : 8046.5625MB
% 0.09/0.58 % OS : Linux 6.8.0-71-generic
% 0.09/0.58 % CPULimit : 300
% 0.09/0.58 % WCLimit : 300
% 0.09/0.58 % DateTime : Sun Sep 20 23:29:10 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.62 Running first-order theorem proving
% 0.09/0.62 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
% 21.66/4.12 % Version: 3.5.1
% 21.66/4.12 % Preprocessing class: FMLLSMLLSSSNFFN.
% 21.66/4.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.66/4.12 % Starting new_bool_3 with 900s (3) cores
% 21.66/4.12 % Starting new_bool_1 with 900s (3) cores
% 21.66/4.12 % Starting sh5l with 300s (1) cores
% 21.66/4.12 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 21.66/4.12 % new_bool_1 with pid 823466 completed with status 0
% 21.66/4.12 % Result found by new_bool_1
% 21.66/4.12 % Preprocessing class: FMLLSMLLSSSNFFN.
% 21.66/4.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.66/4.12 % Starting new_bool_3 with 900s (3) cores
% 21.66/4.12 % Starting new_bool_1 with 900s (3) cores
% 21.66/4.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 21.66/4.12 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.66/4.12 % Search class: FGHSM-SMLM32-MFFFFFNN
% 21.66/4.12 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 21.66/4.12 % Starting SubtermCWHack with 82s (1) cores
% 21.66/4.12 % Starting new_bool_1 with 91s (1) cores
% 21.66/4.12 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 21.66/4.12 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 823474 completed with status 0
% 21.66/4.12 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 21.66/4.12 % Preprocessing class: FMLLSMLLSSSNFFN.
% 21.66/4.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.66/4.12 % Starting new_bool_3 with 900s (3) cores
% 21.66/4.12 % Starting new_bool_1 with 900s (3) cores
% 21.66/4.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 21.66/4.12 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.66/4.12 % Search class: FGHSM-SMLM32-MFFFFFNN
% 21.66/4.12 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 21.66/4.12 % Starting SubtermCWHack with 82s (1) cores
% 21.66/4.12 % Starting new_bool_1 with 91s (1) cores
% 21.66/4.12 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 21.66/4.12 % Preprocessing time : 0.039 s
% 21.66/4.12 % Presaturation interreduction done
% 21.66/4.12 % SatCheck found unsatisfiable ground set
% 21.66/4.12
% 21.66/4.12 % Proof found!
% 21.66/4.12 % SZS status Theorem
% 21.66/4.12 % SZS output start CNFRefutation
% See solution above
% 21.66/4.12 % Parsed axioms : 6427
% 21.66/4.12 % Removed by relevancy pruning/SinE : 5563
% 21.66/4.12 % Initial clauses : 1690
% 21.66/4.12 % Removed in clause preprocessing : 39
% 21.66/4.12 % Initial clauses in saturation : 1651
% 21.66/4.12 % Processed clauses : 17249
% 21.66/4.12 % ...of these trivial : 80
% 21.66/4.12 % ...subsumed : 12169
% 21.66/4.12 % ...remaining for further processing : 5000
% 21.66/4.12 % Other redundant clauses eliminated : 434
% 21.66/4.12 % Clauses deleted for lack of memory : 0
% 21.66/4.12 % Backward-subsumed : 157
% 21.66/4.12 % Backward-rewritten : 39
% 21.66/4.12 % Generated clauses : 66862
% 21.66/4.12 % ...of the previous two non-redundant : 60553
% 21.66/4.12 % ...aggressively subsumed : 0
% 21.66/4.12 % Contextual simplify-reflections : 102
% 21.66/4.12 % Paramodulations : 66388
% 21.66/4.12 % Factorizations : 19
% 21.66/4.12 % NegExts : 0
% 21.66/4.12 % Equation resolutions : 456
% 21.66/4.12 % Disequality decompositions : 0
% 21.66/4.12 % Total rewrite steps : 12641
% 21.66/4.12 % ...of those cached : 10813
% 21.66/4.12 % Propositional unsat checks : 1
% 21.66/4.12 % Propositional check models : 0
% 21.66/4.12 % Propositional check unsatisfiable : 1
% 21.66/4.12 % Propositional clauses : 49165
% 21.66/4.12 % Propositional clauses after purity: 9766
% 21.66/4.12 % Propositional unsat core size : 7
% 21.66/4.12 % Propositional preprocessing time : 0.000
% 21.66/4.12 % Propositional encoding time : 0.123
% 21.66/4.12 % Propositional solver time : 0.021
% 21.66/4.12 % Success case prop preproc time : 0.000
% 21.66/4.12 % Success case prop encoding time : 0.123
% 21.66/4.12 % Success case prop solver time : 0.021
% 21.66/4.12 % Current number of processed clauses : 3137
% 21.66/4.12 % Positive orientable unit clauses : 312
% 21.66/4.12 % Positive unorientable unit clauses: 2
% 21.66/4.12 % Negative unit clauses : 482
% 21.66/4.12 % Non-unit-clauses : 2341
% 21.66/4.12 % Current number of unprocessed clauses: 46028
% 21.66/4.12 % ...number of literals in the above : 194140
% 21.66/4.12 % Current number of archived formulas : 0
% 21.66/4.12 % Current number of archived clauses : 1745
% 21.66/4.12 % Clause-clause subsumption calls (NU) : 3704724
% 21.66/4.12 % Rec. Clause-clause subsumption calls : 853809
% 21.66/4.12 % Non-unit clause-clause subsumptions : 5619
% 21.66/4.12 % Unit Clause-clause subsumption calls : 90989
% 21.66/4.12 % Rewrite failures with RHS unbound : 0
% 21.66/4.12 % BW rewrite match attempts : 307
% 21.66/4.12 % BW rewrite match successes : 200
% 21.66/4.12 % Condensation attempts : 0
% 21.66/4.12 % Condensation successes : 0
% 21.66/4.12 % Termbank termtop insertions : 1525714
% 21.66/4.12 % Search garbage collected termcells : 75448
% 21.66/4.12
% 21.66/4.12 % -------------------------------------------------
% 21.66/4.12 % User time : 3.031 s
% 21.66/4.12 % System time : 0.125 s
% 21.66/4.12 % Total time : 3.156 s
% 21.66/4.12 % Maximum resident set size: 17572 pages
% 21.66/4.12
% 21.66/4.12 % -------------------------------------------------
% 21.66/4.12 % User time : 9.070 s
% 21.66/4.12 % System time : 0.335 s
% 21.66/4.12 % Total time : 9.405 s
% 21.66/4.12 % Maximum resident set size: 12800 pages
% 21.66/4.12 % E exiting
%------------------------------------------------------------------------------