%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT287+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 : n011.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:42 PM UTC 2026
% Result : Theorem 0.39s 1.06s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 127 ( 8 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 142 ( 56 ~; 42 |; 27 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-1 aty)
% Number of variables : 39 ( 1 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_lopclset,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_lopclset) ).
fof(d2_pre_topc,axiom,
! [X1] :
( l1_struct_0(X1)
=> k1_pre_topc(X1) = k1_xboole_0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+206.ax',d2_pre_topc) ).
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(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(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(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(t4_subset_1,axiom,
! [X1] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',t4_subset_1) ).
fof(cc1_tops_1,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v1_xboole_0(X2)
=> ( v4_pre_topc(X2,X1)
& v3_pre_topc(X2,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+207.ax',cc1_tops_1) ).
fof(fc6_membered,axiom,
( v5_membered(k1_xboole_0)
& v4_membered(k1_xboole_0)
& v3_membered(k1_xboole_0)
& v2_membered(k1_xboole_0)
& v1_membered(k1_xboole_0)
& v1_xboole_0(k1_xboole_0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+51.ax',fc6_membered) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(assume_negation,[status(cth)],[t16_lopclset]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k1_pre_topc(X1),u1_struct_0(k6_lopclset(X1))) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X27] :
( k1_pre_topc(X27) = k1_xboole_0
| ~ l1_struct_0(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_pre_topc])])]) ).
fof(c_0_12,plain,
! [X593] :
( l1_struct_0(X593)
| ~ l1_pre_topc(X593) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
fof(c_0_13,negated_conjecture,
( ~ m1_subset_1(k1_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])])])]) ).
cnf(c_0_14,plain,
( ~ l1_struct_0(X1)
| k1_pre_topc(X1) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ l1_pre_topc(X1)
| l1_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ m1_subset_1(k1_pre_topc(esk1_0),u1_struct_0(k6_lopclset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( ~ l1_pre_topc(X1)
| k1_pre_topc(X1) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X717,X718] :
( m1_subset_1(X717,X718)
| ~ r2_hidden(X717,X718) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_20,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]) ).
cnf(c_0_21,negated_conjecture,
~ m1_subset_1(k1_xboole_0,u1_struct_0(k6_lopclset(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( ~ r2_hidden(X1,X2)
| m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
! [X23] :
( u1_struct_0(k6_lopclset(X23)) = k1_lopclset(X23)
| ~ l1_pre_topc(X23)
| ~ v2_pre_topc(X23)
| v3_struct_0(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
fof(c_0_24,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]) ).
cnf(c_0_25,negated_conjecture,
~ r2_hidden(k1_xboole_0,u1_struct_0(k6_lopclset(esk1_0))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
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_23]) ).
cnf(c_0_27,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_29,plain,
! [X349,X350] :
( r2_hidden(X350,k1_lopclset(X349))
| ~ v4_pre_topc(X350,X349)
| ~ v3_pre_topc(X350,X349)
| ~ m1_subset_1(X350,k1_zfmisc_1(u1_struct_0(X349)))
| ~ l1_pre_topc(X349)
| ~ v2_pre_topc(X349)
| v3_struct_0(X349) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
fof(c_0_30,plain,
! [X621] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X621)),
inference(variable_rename,[status(thm)],[t4_subset_1]) ).
cnf(c_0_31,negated_conjecture,
~ r2_hidden(k1_xboole_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_18])]),c_0_28]) ).
cnf(c_0_32,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_29]) ).
cnf(c_0_33,plain,
m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_34,plain,
! [X801,X802] :
( ( ~ l1_pre_topc(X801)
| ~ v2_pre_topc(X801)
| ~ m1_subset_1(X802,k1_zfmisc_1(u1_struct_0(X801)))
| ~ v1_xboole_0(X802)
| v4_pre_topc(X802,X801) )
& ( ~ l1_pre_topc(X801)
| ~ v2_pre_topc(X801)
| ~ m1_subset_1(X802,k1_zfmisc_1(u1_struct_0(X801)))
| ~ v1_xboole_0(X802)
| v3_pre_topc(X802,X801) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_tops_1])])])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ v4_pre_topc(k1_xboole_0,esk1_0)
| ~ v3_pre_topc(k1_xboole_0,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_18]),c_0_33])]),c_0_28]) ).
cnf(c_0_36,plain,
( ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_xboole_0(X1)
| v4_pre_topc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_37,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_38,negated_conjecture,
~ v3_pre_topc(k1_xboole_0,esk1_0),
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_27]),c_0_18]),c_0_33]),c_0_37])]) ).
cnf(c_0_39,plain,
( ~ l1_pre_topc(X2)
| ~ v2_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_xboole_0(X1)
| v3_pre_topc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
$false,
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_38,c_0_39]),c_0_27]),c_0_18]),c_0_33]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT287+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.12/0.38 % Computer : n011.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:26:13 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.43 Running first-order theorem proving
% 0.12/0.43 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
% 0.39/1.06 % Version: 3.5.1
% 0.39/1.06 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.39/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/1.06 % Starting new_bool_3 with 900s (3) cores
% 0.39/1.06 % Starting new_bool_1 with 900s (3) cores
% 0.39/1.06 % Starting sh5l with 300s (1) cores
% 0.39/1.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.39/1.06 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 418116 completed with status 0
% 0.39/1.06 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.39/1.06 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.39/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/1.06 % Starting new_bool_3 with 900s (3) cores
% 0.39/1.06 % Starting new_bool_1 with 900s (3) cores
% 0.39/1.06 % Starting sh5l with 300s (1) cores
% 0.39/1.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.39/1.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/1.06 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 0.39/1.06 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.39/1.06 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.39/1.06 % Starting SubtermCWHack with 28s (1) cores
% 0.39/1.06 % SubtermCWHack with pid 418120 completed with status 0
% 0.39/1.06 % Result found by SubtermCWHack
% 0.39/1.06 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.39/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/1.06 % Starting new_bool_3 with 900s (3) cores
% 0.39/1.06 % Starting new_bool_1 with 900s (3) cores
% 0.39/1.06 % Starting sh5l with 300s (1) cores
% 0.39/1.06 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.39/1.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/1.06 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 0.39/1.06 % Search class: FGHSM-FSLM32-MFFFFFNN
% 0.39/1.06 % Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.39/1.06 % Starting SubtermCWHack with 28s (1) cores
% 0.39/1.06 % Preprocessing time : 0.013 s
% 0.39/1.06
% 0.39/1.06 % Proof found!
% 0.39/1.06 % SZS status Theorem
% 0.39/1.06 % SZS output start CNFRefutation
% See solution above
% 0.39/1.06 % Parsed axioms : 6428
% 0.39/1.06 % Removed by relevancy pruning/SinE : 5927
% 0.39/1.06 % Initial clauses : 1003
% 0.39/1.06 % Removed in clause preprocessing : 28
% 0.39/1.06 % Initial clauses in saturation : 975
% 0.39/1.06 % Processed clauses : 5475
% 0.39/1.06 % ...of these trivial : 183
% 0.39/1.06 % ...subsumed : 3001
% 0.39/1.06 % ...remaining for further processing : 2291
% 0.39/1.06 % Other redundant clauses eliminated : 73
% 0.39/1.06 % Clauses deleted for lack of memory : 0
% 0.39/1.06 % Backward-subsumed : 103
% 0.39/1.06 % Backward-rewritten : 35
% 0.39/1.06 % Generated clauses : 23088
% 0.39/1.06 % ...of the previous two non-redundant : 15748
% 0.39/1.06 % ...aggressively subsumed : 0
% 0.39/1.06 % Contextual simplify-reflections : 8
% 0.39/1.06 % Paramodulations : 23002
% 0.39/1.06 % Factorizations : 3
% 0.39/1.06 % NegExts : 0
% 0.39/1.06 % Equation resolutions : 80
% 0.39/1.06 % Disequality decompositions : 0
% 0.39/1.06 % Total rewrite steps : 10783
% 0.39/1.06 % ...of those cached : 9977
% 0.39/1.06 % Propositional unsat checks : 0
% 0.39/1.06 % Propositional check models : 0
% 0.39/1.06 % Propositional check unsatisfiable : 0
% 0.39/1.06 % Propositional clauses : 0
% 0.39/1.06 % Propositional clauses after purity: 0
% 0.39/1.06 % Propositional unsat core size : 0
% 0.39/1.06 % Propositional preprocessing time : 0.000
% 0.39/1.06 % Propositional encoding time : 0.000
% 0.39/1.06 % Propositional solver time : 0.000
% 0.39/1.06 % Success case prop preproc time : 0.000
% 0.39/1.06 % Success case prop encoding time : 0.000
% 0.39/1.06 % Success case prop solver time : 0.000
% 0.39/1.06 % Current number of processed clauses : 2110
% 0.39/1.06 % Positive orientable unit clauses : 492
% 0.39/1.06 % Positive unorientable unit clauses: 2
% 0.39/1.06 % Negative unit clauses : 215
% 0.39/1.06 % Non-unit-clauses : 1401
% 0.39/1.06 % Current number of unprocessed clauses: 11146
% 0.39/1.06 % ...number of literals in the above : 31462
% 0.39/1.06 % Current number of archived formulas : 0
% 0.39/1.06 % Current number of archived clauses : 146
% 0.39/1.06 % Clause-clause subsumption calls (NU) : 606728
% 0.39/1.06 % Rec. Clause-clause subsumption calls : 416256
% 0.39/1.06 % Non-unit clause-clause subsumptions : 1784
% 0.39/1.06 % Unit Clause-clause subsumption calls : 45889
% 0.39/1.06 % Rewrite failures with RHS unbound : 0
% 0.39/1.06 % BW rewrite match attempts : 311
% 0.39/1.06 % BW rewrite match successes : 52
% 0.39/1.06 % Condensation attempts : 0
% 0.39/1.06 % Condensation successes : 0
% 0.39/1.06 % Termbank termtop insertions : 388697
% 0.39/1.06 % Search garbage collected termcells : 62764
% 0.39/1.06
% 0.39/1.06 % -------------------------------------------------
% 0.39/1.06 % User time : 0.329 s
% 0.39/1.06 % System time : 0.039 s
% 0.39/1.06 % Total time : 0.368 s
% 0.39/1.06 % Maximum resident set size: 15524 pages
% 0.39/1.06
% 0.39/1.06 % -------------------------------------------------
% 0.39/1.06 % User time : 0.544 s
% 0.39/1.06 % System time : 0.055 s
% 0.39/1.06 % Total time : 0.599 s
% 0.39/1.06 % Maximum resident set size: 12800 pages
% 0.39/1.06 % E exiting
%------------------------------------------------------------------------------