%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT286+4 : 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 : n015.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 34.53s 8.19s
% Output : CNFRefutation 34.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 14 unt; 0 def)
% Number of atoms : 120 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 123 ( 47 ~; 36 |; 23 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 0 sgn 26 !; 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(dt_l1_pre_topc,axiom,
! [X1] :
( l1_pre_topc(X1)
=> l1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_l1_pre_topc) ).
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(d3_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k2_pre_topc(X1) = u1_struct_0(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',d3_pre_topc) ).
fof(t4_lopclset,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( v4_pre_topc(X2,X1)
& v3_pre_topc(X2,X1) )
=> r2_hidden(X2,k1_lopclset(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_lopclset) ).
fof(dt_k2_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> m1_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',dt_k2_pre_topc) ).
fof(fc8_tops_1,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1) )
=> ( v4_pre_topc(k2_pre_topc(X1),X1)
& v3_pre_topc(k2_pre_topc(X1),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+207.ax',fc8_tops_1) ).
fof(fc5_pre_topc,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1) )
=> v4_pre_topc(k2_pre_topc(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',fc5_pre_topc) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(c_0_9,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_10,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_9]) ).
fof(c_0_11,plain,
! [X723] :
( l1_struct_0(X723)
| ~ l1_pre_topc(X723) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
fof(c_0_12,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_10])])])]) ).
fof(c_0_13,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_14,plain,
! [X67] :
( k2_pre_topc(X67) = u1_struct_0(X67)
| ~ l1_struct_0(X67) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
cnf(c_0_15,plain,
( ~ l1_pre_topc(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X63] :
( u1_struct_0(k6_lopclset(X63)) = k1_lopclset(X63)
| ~ l1_pre_topc(X63)
| ~ v2_pre_topc(X63)
| v3_struct_0(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_18,plain,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( ( v4_pre_topc(X2,X1)
& v3_pre_topc(X2,X1) )
=> r2_hidden(X2,k1_lopclset(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[t4_lopclset]) ).
fof(c_0_19,plain,
! [X113] :
( m1_subset_1(k2_pre_topc(X113),k1_zfmisc_1(u1_struct_0(X113)))
| ~ l1_struct_0(X113) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])])]) ).
cnf(c_0_20,plain,
( ~ l1_struct_0(X1)
| k2_pre_topc(X1) = u1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
l1_struct_0(esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_22,plain,
! [X114] :
( ( ~ l1_pre_topc(X114)
| ~ v2_pre_topc(X114)
| v4_pre_topc(k2_pre_topc(X114),X114) )
& ( ~ l1_pre_topc(X114)
| ~ v2_pre_topc(X114)
| v3_pre_topc(k2_pre_topc(X114),X114) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc8_tops_1])])])]) ).
fof(c_0_23,plain,
! [X66] :
( v4_pre_topc(k2_pre_topc(X66),X66)
| ~ l1_pre_topc(X66)
| ~ v2_pre_topc(X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_pre_topc])])]) ).
cnf(c_0_24,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_17]) ).
cnf(c_0_25,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X183,X184] :
( r2_hidden(X184,k1_lopclset(X183))
| ~ v4_pre_topc(X184,X183)
| ~ v3_pre_topc(X184,X183)
| ~ m1_subset_1(X184,k1_zfmisc_1(u1_struct_0(X183)))
| ~ l1_pre_topc(X183)
| ~ v2_pre_topc(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_18])])])]) ).
cnf(c_0_28,plain,
( ~ l1_struct_0(X1)
| m1_subset_1(k2_pre_topc(X1),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
k2_pre_topc(esk1_0) = u1_struct_0(esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v3_pre_topc(k2_pre_topc(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v4_pre_topc(k2_pre_topc(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
u1_struct_0(k6_lopclset(esk1_0)) = k1_lopclset(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16])]),c_0_26]) ).
fof(c_0_34,plain,
! [X886,X887] :
( m1_subset_1(X886,X887)
| ~ r2_hidden(X886,X887) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
cnf(c_0_35,plain,
( ~ v4_pre_topc(X2,X1)
| ~ v3_pre_topc(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| r2_hidden(X2,k1_lopclset(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
m1_subset_1(u1_struct_0(esk1_0),k1_zfmisc_1(u1_struct_0(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
v3_pre_topc(u1_struct_0(esk1_0),esk1_0),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_25]),c_0_16])]),c_0_29]) ).
cnf(c_0_38,negated_conjecture,
v4_pre_topc(u1_struct_0(esk1_0),esk1_0),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_16])]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
~ m1_subset_1(k2_pre_topc(esk1_0),k1_lopclset(esk1_0)),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
r2_hidden(u1_struct_0(esk1_0),k1_lopclset(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),c_0_25]),c_0_16])]),c_0_26]) ).
cnf(c_0_42,negated_conjecture,
~ m1_subset_1(u1_struct_0(esk1_0),k1_lopclset(esk1_0)),
inference(rw,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT286+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 23:29:53 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 34.53/8.19 % Version: 3.5.1
% 34.53/8.19 % Preprocessing class: FMLLMLLLSSSNFFN.
% 34.53/8.19 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 34.53/8.19 % Starting new_bool_3 with 894s (3) cores
% 34.53/8.19 % Starting new_bool_1 with 894s (3) cores
% 34.53/8.19 % Starting sh5l with 298s (1) cores
% 34.53/8.19 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 298s (1) cores
% 34.53/8.19 % new_bool_3 with pid 4180144 completed with status 0
% 34.53/8.19 % Result found by new_bool_3
% 34.53/8.19 % Preprocessing class: FMLLMLLLSSSNFFN.
% 34.53/8.19 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 34.53/8.19 % Starting new_bool_3 with 894s (3) cores
% 34.53/8.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 34.53/8.19 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 34.53/8.19 % Search class: FGHSM-SMLM32-DFFFFFNN
% 34.53/8.19 % Scheduled 13 strats onto 3 cores with 894 seconds (894 total)
% 34.53/8.19 % Starting SubtermCWHack with 81s (1) cores
% 34.53/8.19 % Starting new_bool_3 with 90s (1) cores
% 34.53/8.19 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 34.53/8.19 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 4180154 completed with status 0
% 34.53/8.19 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 34.53/8.19 % Preprocessing class: FMLLMLLLSSSNFFN.
% 34.53/8.19 % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 34.53/8.19 % Starting new_bool_3 with 894s (3) cores
% 34.53/8.19 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 34.53/8.19 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 34.53/8.19 % Search class: FGHSM-SMLM32-DFFFFFNN
% 34.53/8.19 % Scheduled 13 strats onto 3 cores with 894 seconds (894 total)
% 34.53/8.19 % Starting SubtermCWHack with 81s (1) cores
% 34.53/8.19 % Starting new_bool_3 with 90s (1) cores
% 34.53/8.19 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 34.53/8.19 % Preprocessing time : 0.167 s
% 34.53/8.19
% 34.53/8.19 % Proof found!
% 34.53/8.19 % SZS status Theorem
% 34.53/8.19 % SZS output start CNFRefutation
% See solution above
% 34.53/8.19 % Parsed axioms : 32138
% 34.53/8.19 % Removed by relevancy pruning/SinE : 30596
% 34.53/8.19 % Initial clauses : 3393
% 34.53/8.19 % Removed in clause preprocessing : 125
% 34.53/8.19 % Initial clauses in saturation : 3268
% 34.53/8.19 % Processed clauses : 3526
% 34.53/8.19 % ...of these trivial : 31
% 34.53/8.19 % ...subsumed : 189
% 34.53/8.19 % ...remaining for further processing : 3306
% 34.53/8.19 % Other redundant clauses eliminated : 536
% 34.53/8.19 % Clauses deleted for lack of memory : 0
% 34.53/8.19 % Backward-subsumed : 1
% 34.53/8.19 % Backward-rewritten : 27
% 34.53/8.19 % Generated clauses : 42296
% 34.53/8.19 % ...of the previous two non-redundant : 40131
% 34.53/8.19 % ...aggressively subsumed : 0
% 34.53/8.19 % Contextual simplify-reflections : 158
% 34.53/8.19 % Paramodulations : 41689
% 34.53/8.19 % Factorizations : 26
% 34.53/8.19 % NegExts : 0
% 34.53/8.19 % Equation resolutions : 599
% 34.53/8.19 % Disequality decompositions : 0
% 34.53/8.19 % Total rewrite steps : 5887
% 34.53/8.19 % ...of those cached : 4989
% 34.53/8.19 % Propositional unsat checks : 0
% 34.53/8.19 % Propositional check models : 0
% 34.53/8.19 % Propositional check unsatisfiable : 0
% 34.53/8.19 % Propositional clauses : 0
% 34.53/8.19 % Propositional clauses after purity: 0
% 34.53/8.19 % Propositional unsat core size : 0
% 34.53/8.19 % Propositional preprocessing time : 0.000
% 34.53/8.19 % Propositional encoding time : 0.000
% 34.53/8.19 % Propositional solver time : 0.000
% 34.53/8.19 % Success case prop preproc time : 0.000
% 34.53/8.19 % Success case prop encoding time : 0.000
% 34.53/8.19 % Success case prop solver time : 0.000
% 34.53/8.19 % Current number of processed clauses : 3044
% 34.53/8.19 % Positive orientable unit clauses : 395
% 34.53/8.19 % Positive unorientable unit clauses: 3
% 34.53/8.19 % Negative unit clauses : 84
% 34.53/8.19 % Non-unit-clauses : 2562
% 34.53/8.19 % Current number of unprocessed clauses: 39866
% 34.53/8.19 % ...number of literals in the above : 222850
% 34.53/8.19 % Current number of archived formulas : 0
% 34.53/8.19 % Current number of archived clauses : 28
% 34.53/8.19 % Clause-clause subsumption calls (NU) : 3692725
% 34.53/8.19 % Rec. Clause-clause subsumption calls : 259311
% 34.53/8.19 % Non-unit clause-clause subsumptions : 316
% 34.53/8.19 % Unit Clause-clause subsumption calls : 155727
% 34.53/8.19 % Rewrite failures with RHS unbound : 0
% 34.53/8.19 % BW rewrite match attempts : 84
% 34.53/8.19 % BW rewrite match successes : 58
% 34.53/8.19 % Condensation attempts : 0
% 34.53/8.19 % Condensation successes : 0
% 34.53/8.19 % Termbank termtop insertions : 2121024
% 34.53/8.19 % Search garbage collected termcells : 366735
% 34.53/8.19
% 34.53/8.19 % -------------------------------------------------
% 34.53/8.19 % User time : 5.102 s
% 34.53/8.19 % System time : 0.284 s
% 34.53/8.19 % Total time : 5.386 s
% 34.53/8.19 % Maximum resident set size: 65616 pages
% 34.53/8.19
% 34.53/8.19 % -------------------------------------------------
% 34.53/8.19 % User time : 15.596 s
% 34.53/8.19 % System time : 0.774 s
% 34.53/8.19 % Total time : 16.370 s
% 34.53/8.19 % Maximum resident set size: 52736 pages
% 34.53/8.19 % E exiting
%------------------------------------------------------------------------------