%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP641+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 : n018.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 12:44:30 PM UTC 2026
% Result : Theorem 2.92s 6.26s
% Output : CNFRefutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 150 ( 5 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 178 ( 60 ~; 51 |; 41 &)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_latsubgr,conjecture,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_latsubgr) ).
fof(t56_group_2,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_group_2(X2,X1)
=> ! [X3] :
( m1_group_2(X3,X1)
=> r1_rlvect_1(X3,k2_group_1(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+246.ax',t56_group_2) ).
fof(t53_group_2,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_group_2(X2,X1)
=> k2_group_1(X2) = k2_group_1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+246.ax',t53_group_2) ).
fof(t18_latsubgr,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
<=> r1_rlvect_1(X2,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_latsubgr) ).
fof(dt_k2_group_1,axiom,
! [X1] :
( ( l1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k2_group_1(X1),u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+212.ax',dt_k2_group_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
inference(assume_negation,[status(cth)],[t19_latsubgr]) ).
fof(c_0_6,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_group_2(X2,X1)
=> ! [X3] :
( m1_group_2(X3,X1)
=> r1_rlvect_1(X3,k2_group_1(X2)) ) ) ),
inference(fof_simplification,[status(thm)],[t56_group_2]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_group_2(X2,X1)
=> k2_group_1(X2) = k2_group_1(X1) ) ),
inference(fof_simplification,[status(thm)],[t53_group_2]) ).
fof(c_0_9,plain,
! [X178,X179,X180] :
( r1_rlvect_1(X180,k2_group_1(X179))
| ~ m1_group_2(X180,X178)
| ~ m1_group_2(X179,X178)
| ~ l1_group_1(X178)
| ~ v4_group_1(X178)
| ~ v3_group_1(X178)
| v3_struct_0(X178) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,negated_conjecture,
( ~ r2_hidden(k2_group_1(esk1_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& m1_group_2(esk2_0,esk1_0)
& v1_group_1(esk2_0)
& l1_group_1(esk1_0)
& v4_group_1(esk1_0)
& v3_group_1(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_7])])])]) ).
fof(c_0_11,plain,
! [X171,X172] :
( k2_group_1(X172) = k2_group_1(X171)
| ~ m1_group_2(X172,X171)
| ~ l1_group_1(X171)
| ~ v4_group_1(X171)
| ~ v3_group_1(X171)
| v3_struct_0(X171) ),
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_12,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( ( m1_group_2(X2,X1)
& v1_group_1(X2) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
<=> r1_rlvect_1(X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[t18_latsubgr]) ).
cnf(c_0_13,plain,
( ~ m1_group_2(X3,X1)
| ~ m1_group_2(X2,X1)
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| r1_rlvect_1(X3,k2_group_1(X2))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( ~ m1_group_2(X2,X1)
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| k2_group_1(X2) = k2_group_1(X1)
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X131,X132,X133] :
( ( ~ l1_group_1(X131)
| ~ v4_group_1(X131)
| ~ v3_group_1(X131)
| v3_struct_0(X131)
| ~ m1_group_2(X132,X131)
| ~ v1_group_1(X132)
| ~ m1_subset_1(X133,u1_struct_0(X131))
| r2_hidden(X133,k1_funct_1(k1_latsubgr(X131),X132))
| ~ r1_rlvect_1(X132,X133) )
& ( ~ l1_group_1(X131)
| ~ v4_group_1(X131)
| ~ v3_group_1(X131)
| v3_struct_0(X131)
| ~ m1_group_2(X132,X131)
| ~ v1_group_1(X132)
| ~ m1_subset_1(X133,u1_struct_0(X131))
| r1_rlvect_1(X132,X133)
| ~ r2_hidden(X133,k1_funct_1(k1_latsubgr(X131),X132)) ) ),
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_12])])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ m1_group_2(X1,esk1_0)
| r1_rlvect_1(esk2_0,k2_group_1(X1)) ),
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_13,c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
k2_group_1(esk2_0) = k2_group_1(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_19,c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]) ).
fof(c_0_23,plain,
! [X1] :
( ( l1_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k2_group_1(X1),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k2_group_1]) ).
cnf(c_0_24,negated_conjecture,
~ r2_hidden(k2_group_1(esk1_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( ~ l1_group_1(X3)
| ~ v4_group_1(X3)
| ~ v3_group_1(X3)
| ~ m1_group_2(X1,X3)
| ~ v1_group_1(X1)
| ~ m1_subset_1(X2,u1_struct_0(X3))
| ~ r1_rlvect_1(X1,X2)
| v3_struct_0(X3)
| r2_hidden(X2,k1_funct_1(k1_latsubgr(X3),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_27,negated_conjecture,
r1_rlvect_1(esk2_0,k2_group_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14])]) ).
fof(c_0_28,plain,
! [X161] :
( m1_subset_1(k2_group_1(X161),u1_struct_0(X161))
| ~ l1_group_1(X161)
| v3_struct_0(X161) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,negated_conjecture,
~ m1_subset_1(k2_group_1(esk1_0),u1_struct_0(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]),c_0_15]),c_0_16]),c_0_26]),c_0_17]),c_0_27])]),c_0_18]) ).
cnf(c_0_30,plain,
( ~ l1_group_1(X1)
| m1_subset_1(k2_group_1(X1),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP641+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.11/5.55 % Computer : n018.cluster.edu
% 0.11/5.55 % Model : x86_64 x86_64
% 0.11/5.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.55 % Memory : 8046.5625MB
% 0.11/5.55 % OS : Linux 6.8.0-71-generic
% 0.11/5.55 % CPULimit : 300
% 0.11/5.55 % WCLimit : 300
% 0.11/5.55 % DateTime : Sun Sep 20 20:27:08 UTC 2026
% 0.11/5.55 % CPUTime :
% 0.11/5.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.59 Running first-order theorem proving
% 0.11/5.59 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
% 2.92/6.26 % Version: 3.5.1
% 2.92/6.26 % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.92/6.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/6.26 % Starting new_bool_3 with 900s (3) cores
% 2.92/6.26 % Starting new_bool_1 with 900s (3) cores
% 2.92/6.26 % Starting sh5l with 300s (1) cores
% 2.92/6.26 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.92/6.26 % new_bool_3 with pid 129297 completed with status 0
% 2.92/6.26 % Result found by new_bool_3
% 2.92/6.26 % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.92/6.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/6.26 % Starting new_bool_3 with 900s (3) cores
% 2.92/6.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.92/6.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.92/6.26 % Search class: FGHSM-SMLM32-MFFFFFNN
% 2.92/6.26 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 2.92/6.26 % Starting SubtermCWHack with 82s (1) cores
% 2.92/6.26 % Starting new_bool_3 with 91s (1) cores
% 2.92/6.26 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 2.92/6.26 % SubtermCWHack with pid 129306 completed with status 0
% 2.92/6.26 % Result found by SubtermCWHack
% 2.92/6.26 % Preprocessing class: FMLLSMLLSSSNFFN.
% 2.92/6.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/6.26 % Starting new_bool_3 with 900s (3) cores
% 2.92/6.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.92/6.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.92/6.26 % Search class: FGHSM-SMLM32-MFFFFFNN
% 2.92/6.26 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 2.92/6.26 % Starting SubtermCWHack with 82s (1) cores
% 2.92/6.26 % Preprocessing time : 0.019 s
% 2.92/6.26
% 2.92/6.26 % Proof found!
% 2.92/6.26 % SZS status Theorem
% 2.92/6.26 % SZS output start CNFRefutation
% See solution above
% 2.92/6.26 % Parsed axioms : 5658
% 2.92/6.26 % Removed by relevancy pruning/SinE : 4994
% 2.92/6.26 % Initial clauses : 1364
% 2.92/6.26 % Removed in clause preprocessing : 63
% 2.92/6.26 % Initial clauses in saturation : 1301
% 2.92/6.26 % Processed clauses : 5798
% 2.92/6.26 % ...of these trivial : 171
% 2.92/6.26 % ...subsumed : 3772
% 2.92/6.26 % ...remaining for further processing : 1855
% 2.92/6.26 % Other redundant clauses eliminated : 98
% 2.92/6.26 % Clauses deleted for lack of memory : 0
% 2.92/6.26 % Backward-subsumed : 27
% 2.92/6.26 % Backward-rewritten : 102
% 2.92/6.26 % Generated clauses : 20209
% 2.92/6.26 % ...of the previous two non-redundant : 15631
% 2.92/6.26 % ...aggressively subsumed : 0
% 2.92/6.26 % Contextual simplify-reflections : 14
% 2.92/6.26 % Paramodulations : 20101
% 2.92/6.26 % Factorizations : 2
% 2.92/6.26 % NegExts : 0
% 2.92/6.26 % Equation resolutions : 108
% 2.92/6.26 % Disequality decompositions : 0
% 2.92/6.26 % Total rewrite steps : 8238
% 2.92/6.26 % ...of those cached : 7171
% 2.92/6.26 % Propositional unsat checks : 0
% 2.92/6.26 % Propositional check models : 0
% 2.92/6.26 % Propositional check unsatisfiable : 0
% 2.92/6.26 % Propositional clauses : 0
% 2.92/6.26 % Propositional clauses after purity: 0
% 2.92/6.26 % Propositional unsat core size : 0
% 2.92/6.26 % Propositional preprocessing time : 0.000
% 2.92/6.26 % Propositional encoding time : 0.000
% 2.92/6.26 % Propositional solver time : 0.000
% 2.92/6.26 % Success case prop preproc time : 0.000
% 2.92/6.26 % Success case prop encoding time : 0.000
% 2.92/6.26 % Success case prop solver time : 0.000
% 2.92/6.26 % Current number of processed clauses : 1685
% 2.92/6.26 % Positive orientable unit clauses : 354
% 2.92/6.26 % Positive unorientable unit clauses: 3
% 2.92/6.26 % Negative unit clauses : 278
% 2.92/6.26 % Non-unit-clauses : 1050
% 2.92/6.26 % Current number of unprocessed clauses: 10857
% 2.92/6.26 % ...number of literals in the above : 36406
% 2.92/6.26 % Current number of archived formulas : 0
% 2.92/6.26 % Current number of archived clauses : 129
% 2.92/6.26 % Clause-clause subsumption calls (NU) : 468560
% 2.92/6.26 % Rec. Clause-clause subsumption calls : 160675
% 2.92/6.26 % Non-unit clause-clause subsumptions : 1353
% 2.92/6.26 % Unit Clause-clause subsumption calls : 86215
% 2.92/6.26 % Rewrite failures with RHS unbound : 0
% 2.92/6.26 % BW rewrite match attempts : 221
% 2.92/6.26 % BW rewrite match successes : 78
% 2.92/6.26 % Condensation attempts : 0
% 2.92/6.26 % Condensation successes : 0
% 2.92/6.26 % Termbank termtop insertions : 442323
% 2.92/6.26 % Search garbage collected termcells : 65034
% 2.92/6.26
% 2.92/6.26 % -------------------------------------------------
% 2.92/6.26 % User time : 0.393 s
% 2.92/6.26 % System time : 0.045 s
% 2.92/6.26 % Total time : 0.438 s
% 2.92/6.26 % Maximum resident set size: 15404 pages
% 2.92/6.26
% 2.92/6.26 % -------------------------------------------------
% 2.92/6.26 % User time : 1.159 s
% 2.92/6.26 % System time : 0.097 s
% 2.92/6.26 % Total time : 1.255 s
% 2.92/6.26 % Maximum resident set size: 11776 pages
% 2.92/6.26 % E exiting
%------------------------------------------------------------------------------