%------------------------------------------------------------------------------
% File : E---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 : n004.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:40:31 PM UTC 2026
% Result : Theorem 1.46s 6.44s
% Output : CNFRefutation 1.46s
% 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,
! [X157,X158,X159] :
( r1_rlvect_1(X159,k2_group_1(X158))
| ~ m1_group_2(X159,X157)
| ~ m1_group_2(X158,X157)
| ~ l1_group_1(X157)
| ~ v4_group_1(X157)
| ~ v3_group_1(X157)
| v3_struct_0(X157) ),
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,
! [X150,X151] :
( k2_group_1(X151) = k2_group_1(X150)
| ~ m1_group_2(X151,X150)
| ~ l1_group_1(X150)
| ~ v4_group_1(X150)
| ~ v3_group_1(X150)
| v3_struct_0(X150) ),
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,
! [X149] :
( m1_subset_1(k2_group_1(X149),u1_struct_0(X149))
| ~ l1_group_1(X149)
| v3_struct_0(X149) ),
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.04 % Problem : GRP641+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.45 % Computer : n004.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Sun Sep 20 20:24:57 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.52 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
% 1.46/6.44 % Version: 3.5.1
% 1.46/6.44 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.46/6.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/6.44 % Starting new_bool_3 with 900s (3) cores
% 1.46/6.44 % Starting new_bool_1 with 900s (3) cores
% 1.46/6.44 % Starting sh5l with 300s (1) cores
% 1.46/6.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.46/6.44 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1419054 completed with status 0
% 1.46/6.44 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 1.46/6.44 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.46/6.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/6.44 % Starting new_bool_3 with 900s (3) cores
% 1.46/6.44 % Starting new_bool_1 with 900s (3) cores
% 1.46/6.44 % Starting sh5l with 300s (1) cores
% 1.46/6.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.46/6.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.46/6.44 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 1.46/6.44 % Search class: FGHSM-FMLM32-MFFFFFNN
% 1.46/6.44 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 1.46/6.44 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.46/6.44 % Starting SubtermCWHack with 28s (1) cores
% 1.46/6.44 % SubtermCWHack with pid 1419058 completed with status 0
% 1.46/6.44 % Result found by SubtermCWHack
% 1.46/6.44 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.46/6.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.46/6.44 % Starting new_bool_3 with 900s (3) cores
% 1.46/6.44 % Starting new_bool_1 with 900s (3) cores
% 1.46/6.44 % Starting sh5l with 300s (1) cores
% 1.46/6.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.46/6.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.46/6.44 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 1.46/6.44 % Search class: FGHSM-FMLM32-MFFFFFNN
% 1.46/6.44 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 1.46/6.44 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.46/6.44 % Starting SubtermCWHack with 28s (1) cores
% 1.46/6.44 % Preprocessing time : 0.018 s
% 1.46/6.44
% 1.46/6.44 % Proof found!
% 1.46/6.44 % SZS status Theorem
% 1.46/6.44 % SZS output start CNFRefutation
% See solution above
% 1.46/6.44 % Parsed axioms : 5658
% 1.46/6.44 % Removed by relevancy pruning/SinE : 5157
% 1.46/6.44 % Initial clauses : 985
% 1.46/6.44 % Removed in clause preprocessing : 45
% 1.46/6.44 % Initial clauses in saturation : 940
% 1.46/6.44 % Processed clauses : 4248
% 1.46/6.44 % ...of these trivial : 81
% 1.46/6.44 % ...subsumed : 2733
% 1.46/6.44 % ...remaining for further processing : 1434
% 1.46/6.44 % Other redundant clauses eliminated : 141
% 1.46/6.44 % Clauses deleted for lack of memory : 0
% 1.46/6.44 % Backward-subsumed : 36
% 1.46/6.44 % Backward-rewritten : 88
% 1.46/6.44 % Generated clauses : 19030
% 1.46/6.44 % ...of the previous two non-redundant : 15402
% 1.46/6.44 % ...aggressively subsumed : 0
% 1.46/6.44 % Contextual simplify-reflections : 13
% 1.46/6.44 % Paramodulations : 18880
% 1.46/6.44 % Factorizations : 3
% 1.46/6.44 % NegExts : 0
% 1.46/6.44 % Equation resolutions : 151
% 1.46/6.44 % Disequality decompositions : 0
% 1.46/6.44 % Total rewrite steps : 6867
% 1.46/6.44 % ...of those cached : 6290
% 1.46/6.44 % Propositional unsat checks : 0
% 1.46/6.44 % Propositional check models : 0
% 1.46/6.44 % Propositional check unsatisfiable : 0
% 1.46/6.44 % Propositional clauses : 0
% 1.46/6.44 % Propositional clauses after purity: 0
% 1.46/6.44 % Propositional unsat core size : 0
% 1.46/6.44 % Propositional preprocessing time : 0.000
% 1.46/6.44 % Propositional encoding time : 0.000
% 1.46/6.44 % Propositional solver time : 0.000
% 1.46/6.44 % Success case prop preproc time : 0.000
% 1.46/6.44 % Success case prop encoding time : 0.000
% 1.46/6.44 % Success case prop solver time : 0.000
% 1.46/6.44 % Current number of processed clauses : 1254
% 1.46/6.44 % Positive orientable unit clauses : 201
% 1.46/6.44 % Positive unorientable unit clauses: 4
% 1.46/6.44 % Negative unit clauses : 219
% 1.46/6.44 % Non-unit-clauses : 830
% 1.46/6.44 % Current number of unprocessed clauses: 11830
% 1.46/6.44 % ...number of literals in the above : 40268
% 1.46/6.44 % Current number of archived formulas : 0
% 1.46/6.44 % Current number of archived clauses : 127
% 1.46/6.44 % Clause-clause subsumption calls (NU) : 228813
% 1.46/6.44 % Rec. Clause-clause subsumption calls : 103128
% 1.46/6.44 % Non-unit clause-clause subsumptions : 1015
% 1.46/6.44 % Unit Clause-clause subsumption calls : 17900
% 1.46/6.44 % Rewrite failures with RHS unbound : 0
% 1.46/6.44 % BW rewrite match attempts : 153
% 1.46/6.44 % BW rewrite match successes : 70
% 1.46/6.44 % Condensation attempts : 0
% 1.46/6.44 % Condensation successes : 0
% 1.46/6.44 % Termbank termtop insertions : 380447
% 1.46/6.44 % Search garbage collected termcells : 55846
% 1.46/6.44
% 1.46/6.44 % -------------------------------------------------
% 1.46/6.44 % User time : 0.467 s
% 1.46/6.44 % System time : 0.047 s
% 1.46/6.44 % Total time : 0.514 s
% 1.46/6.44 % Maximum resident set size: 13612 pages
% 1.46/6.44
% 1.46/6.44 % -------------------------------------------------
% 1.46/6.44 % User time : 0.811 s
% 1.46/6.44 % System time : 0.072 s
% 1.46/6.44 % Total time : 0.883 s
% 1.46/6.44 % Maximum resident set size: 11776 pages
% 1.46/6.44 % E exiting
%------------------------------------------------------------------------------