%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP028+1 : 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 : n001.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 03:53:53 PM UTC 2026
% Result : Theorem 0.70s 0.66s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 151 ( 6 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 189 ( 75 ~; 59 |; 36 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 6 sgn 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_tsp_2,conjecture,
! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( v1_tsp_2(X2,X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_tsp_2) ).
fof(t9_tsp_2,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)))
=> ~ ( ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tsp_2(X3,X1)
& r1_tarski(X2,X3) ) )
& v1_tsp_1(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_tsp_2) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( v1_xboole_0(X2)
& X1 != X2
& v1_xboole_0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).
fof(t11_tsp_1,axiom,
! [X1] :
( ( l1_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_tex_2(X2,X1)
=> v1_tsp_1(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t11_tsp_1) ).
fof(t35_tex_2,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)))
& v1_xboole_0(X2) )
=> v3_tex_2(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t35_tex_2) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( v1_xboole_0(X2)
& m1_subset_1(X2,k1_zfmisc_1(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( v1_tsp_2(X2,X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(assume_negation,[status(cth)],[t10_tsp_2]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( l1_pre_topc(X1)
& v2_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ? [X2] :
( v1_tsp_2(X2,X1)
& m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1))) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,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)))
=> ~ ( ! [X3] :
( m1_subset_1(X3,k1_zfmisc_1(u1_struct_0(X1)))
=> ~ ( v1_tsp_2(X3,X1)
& r1_tarski(X2,X3) ) )
& v1_tsp_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t9_tsp_2]) ).
fof(c_0_9,plain,
! [X1,X2] :
~ ( v1_xboole_0(X2)
& X1 != X2
& v1_xboole_0(X1) ),
inference(fof_simplification,[status(thm)],[t8_boole]) ).
fof(c_0_10,negated_conjecture,
! [X5] :
( ( ~ v1_tsp_2(X5,esk1_0)
| ~ m1_subset_1(X5,k1_zfmisc_1(u1_struct_0(esk1_0))) )
& l1_pre_topc(esk1_0)
& v2_pre_topc(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_7])])])])]) ).
fof(c_0_11,plain,
! [X6,X7] :
( ( ~ l1_pre_topc(X6)
| ~ v2_pre_topc(X6)
| v3_struct_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(u1_struct_0(X6)))
| ~ v1_tsp_1(X7,X6)
| v1_tsp_2(esk2_2(X6,X7),X6) )
& ( ~ l1_pre_topc(X6)
| ~ v2_pre_topc(X6)
| v3_struct_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(u1_struct_0(X6)))
| ~ v1_tsp_1(X7,X6)
| r1_tarski(X7,esk2_2(X6,X7)) )
& ( ~ l1_pre_topc(X6)
| ~ v2_pre_topc(X6)
| v3_struct_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(u1_struct_0(X6)))
| ~ v1_tsp_1(X7,X6)
| m1_subset_1(esk2_2(X6,X7),k1_zfmisc_1(u1_struct_0(X6))) ) ),
inference(distribute,[status(thm)],[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,
! [X1] :
( ( l1_pre_topc(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
=> ( v3_tex_2(X2,X1)
=> v1_tsp_1(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t11_tsp_1]) ).
fof(c_0_13,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)))
& v1_xboole_0(X2) )
=> v3_tex_2(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[t35_tex_2]) ).
fof(c_0_14,plain,
! [X30,X31] :
( ~ v1_xboole_0(X31)
| X30 = X31
| ~ v1_xboole_0(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_15,plain,
! [X13] :
( v1_xboole_0(esk5_1(X13))
& m1_subset_1(esk5_1(X13),k1_zfmisc_1(X13)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_16,negated_conjecture,
( ~ v1_tsp_2(X1,esk1_0)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1)
| v3_struct_0(X1)
| v1_tsp_2(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
l1_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
v2_pre_topc(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_21,plain,
! [X28,X29] :
( v1_tsp_1(X29,X28)
| ~ v3_tex_2(X29,X28)
| ~ m1_subset_1(X29,k1_zfmisc_1(u1_struct_0(X28)))
| ~ l1_pre_topc(X28)
| v3_struct_0(X28) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_22,plain,
! [X46,X47] :
( v3_tex_2(X47,X46)
| ~ m1_subset_1(X47,k1_zfmisc_1(u1_struct_0(X46)))
| ~ v1_xboole_0(X47)
| ~ l1_pre_topc(X46)
| ~ v2_pre_topc(X46)
| v3_struct_0(X46) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_23,plain,
( ~ v1_xboole_0(X2)
| ~ v1_xboole_0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
v1_xboole_0(esk5_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ m1_subset_1(esk2_2(esk1_0,X1),k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_1(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_26,plain,
( ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_tsp_1(X2,X1)
| v3_struct_0(X1)
| m1_subset_1(esk2_2(X1,X2),k1_zfmisc_1(u1_struct_0(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( ~ v3_tex_2(X2,X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ l1_pre_topc(X1)
| v1_tsp_1(X2,X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
| ~ v1_xboole_0(X2)
| ~ l1_pre_topc(X1)
| ~ v2_pre_topc(X1)
| v3_tex_2(X2,X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ v1_xboole_0(X1)
| X1 = esk5_1(X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_tsp_1(X1,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_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_31,plain,
( ~ v2_pre_topc(X2)
| ~ l1_pre_topc(X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(X2)))
| ~ v1_xboole_0(X1)
| v3_struct_0(X2)
| v1_tsp_1(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
m1_subset_1(esk5_1(X1),k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,plain,
esk5_1(X1) = esk5_1(X2),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(u1_struct_0(esk1_0)))
| ~ v1_xboole_0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_35,plain,
m1_subset_1(esk5_1(X1),k1_zfmisc_1(X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : TOP028+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 % Computer : n001.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Mon Sep 21 12:46:30 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.70/0.66 % Version: 3.5.1
% 0.70/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.70/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.70/0.66 % Starting sh5l with 300s (1) cores
% 0.70/0.66 % new_bool_3 with pid 3131161 completed with status 0
% 0.70/0.66 % Result found by new_bool_3
% 0.70/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.70/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.70/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.70/0.66 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.70/0.66 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.70/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.70/0.66 % SubtermCWHack with pid 3131165 completed with status 0
% 0.70/0.66 % Result found by SubtermCWHack
% 0.70/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.70/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.70/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.70/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.70/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.70/0.66 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.70/0.66 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.70/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.70/0.66 % Preprocessing time : 0.003 s
% 0.70/0.66
% 0.70/0.66 % Proof found!
% 0.70/0.66 % SZS status Theorem
% 0.70/0.66 % SZS output start CNFRefutation
% See solution above
% 0.70/0.66 % Parsed axioms : 63
% 0.70/0.66 % Removed by relevancy pruning/SinE : 22
% 0.70/0.66 % Initial clauses : 107
% 0.70/0.66 % Removed in clause preprocessing : 3
% 0.70/0.66 % Initial clauses in saturation : 104
% 0.70/0.66 % Processed clauses : 564
% 0.70/0.66 % ...of these trivial : 0
% 0.70/0.66 % ...subsumed : 292
% 0.70/0.66 % ...remaining for further processing : 272
% 0.70/0.66 % Other redundant clauses eliminated : 0
% 0.70/0.66 % Clauses deleted for lack of memory : 0
% 0.70/0.66 % Backward-subsumed : 1
% 0.70/0.66 % Backward-rewritten : 6
% 0.70/0.66 % Generated clauses : 600
% 0.70/0.66 % ...of the previous two non-redundant : 529
% 0.70/0.66 % ...aggressively subsumed : 0
% 0.70/0.66 % Contextual simplify-reflections : 0
% 0.70/0.66 % Paramodulations : 600
% 0.70/0.66 % Factorizations : 0
% 0.70/0.66 % NegExts : 0
% 0.70/0.66 % Equation resolutions : 0
% 0.70/0.66 % Disequality decompositions : 0
% 0.70/0.66 % Total rewrite steps : 89
% 0.70/0.66 % ...of those cached : 68
% 0.70/0.66 % Propositional unsat checks : 0
% 0.70/0.66 % Propositional check models : 0
% 0.70/0.66 % Propositional check unsatisfiable : 0
% 0.70/0.66 % Propositional clauses : 0
% 0.70/0.66 % Propositional clauses after purity: 0
% 0.70/0.66 % Propositional unsat core size : 0
% 0.70/0.66 % Propositional preprocessing time : 0.000
% 0.70/0.66 % Propositional encoding time : 0.000
% 0.70/0.66 % Propositional solver time : 0.000
% 0.70/0.66 % Success case prop preproc time : 0.000
% 0.70/0.66 % Success case prop encoding time : 0.000
% 0.70/0.66 % Success case prop solver time : 0.000
% 0.70/0.66 % Current number of processed clauses : 265
% 0.70/0.66 % Positive orientable unit clauses : 20
% 0.70/0.66 % Positive unorientable unit clauses: 1
% 0.70/0.66 % Negative unit clauses : 5
% 0.70/0.66 % Non-unit-clauses : 239
% 0.70/0.66 % Current number of unprocessed clauses: 55
% 0.70/0.66 % ...number of literals in the above : 355
% 0.70/0.66 % Current number of archived formulas : 0
% 0.70/0.66 % Current number of archived clauses : 7
% 0.70/0.66 % Clause-clause subsumption calls (NU) : 21236
% 0.70/0.66 % Rec. Clause-clause subsumption calls : 7039
% 0.70/0.66 % Non-unit clause-clause subsumptions : 287
% 0.70/0.66 % Unit Clause-clause subsumption calls : 120
% 0.70/0.66 % Rewrite failures with RHS unbound : 16
% 0.70/0.66 % BW rewrite match attempts : 13
% 0.70/0.66 % BW rewrite match successes : 10
% 0.70/0.66 % Condensation attempts : 0
% 0.70/0.66 % Condensation successes : 0
% 0.70/0.66 % Termbank termtop insertions : 15339
% 0.70/0.66 % Search garbage collected termcells : 1306
% 0.70/0.66
% 0.70/0.66 % -------------------------------------------------
% 0.70/0.66 % User time : 0.056 s
% 0.70/0.66 % System time : 0.005 s
% 0.70/0.66 % Total time : 0.061 s
% 0.70/0.66 % Maximum resident set size: 3952 pages
% 0.70/0.66
% 0.70/0.66 % -------------------------------------------------
% 0.70/0.66 % User time : 0.060 s
% 0.70/0.66 % System time : 0.008 s
% 0.70/0.66 % Total time : 0.068 s
% 0.70/0.66 % Maximum resident set size: 4608 pages
% 0.70/0.66 % E exiting
%------------------------------------------------------------------------------