%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP644+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 : n012.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:32 PM UTC 2026
% Result : Theorem 0.08s 0.55s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 161 ( 0 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 199 ( 68 ~; 58 |; 43 &)
% ( 2 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t22_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) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
=> r2_hidden(k3_group_1(X1,X3),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_latsubgr) ).
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(t60_group_2,axiom,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_group_2(X3,X1)
=> ( r1_rlvect_1(X3,X2)
=> r1_rlvect_1(X3,k3_group_1(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_group_2) ).
fof(dt_k3_group_1,axiom,
! [X1,X2] :
( ( m1_subset_1(X2,u1_struct_0(X1))
& l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k3_group_1(X1,X2),u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_group_1) ).
fof(c_0_4,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) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
=> r2_hidden(k3_group_1(X1,X3),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ),
inference(assume_negation,[status(cth)],[t22_latsubgr]) ).
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) )
=> ! [X3] :
( m1_subset_1(X3,u1_struct_0(X1))
=> ( r2_hidden(X3,k1_funct_1(k1_latsubgr(X1),X2))
=> r2_hidden(k3_group_1(X1,X3),k1_funct_1(k1_latsubgr(X1),X2)) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
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)
& 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]) ).
fof(c_0_7,negated_conjecture,
( ~ r2_hidden(k3_group_1(esk1_0,esk3_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0))
& m1_subset_1(esk3_0,u1_struct_0(esk1_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_5])])])]) ).
fof(c_0_8,plain,
! [X22,X23,X24] :
( ( ~ l1_group_1(X22)
| ~ v4_group_1(X22)
| ~ v3_group_1(X22)
| v3_struct_0(X22)
| ~ m1_group_2(X23,X22)
| ~ v1_group_1(X23)
| ~ m1_subset_1(X24,u1_struct_0(X22))
| r2_hidden(X24,k1_funct_1(k1_latsubgr(X22),X23))
| ~ r1_rlvect_1(X23,X24) )
& ( ~ l1_group_1(X22)
| ~ v4_group_1(X22)
| ~ v3_group_1(X22)
| v3_struct_0(X22)
| ~ m1_group_2(X23,X22)
| ~ v1_group_1(X23)
| ~ m1_subset_1(X24,u1_struct_0(X22))
| r1_rlvect_1(X23,X24)
| ~ r2_hidden(X24,k1_funct_1(k1_latsubgr(X22),X23)) ) ),
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_6])])])])]) ).
fof(c_0_9,plain,
! [X1] :
( ( l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> ! [X2] :
( m1_subset_1(X2,u1_struct_0(X1))
=> ! [X3] :
( m1_group_2(X3,X1)
=> ( r1_rlvect_1(X3,X2)
=> r1_rlvect_1(X3,k3_group_1(X1,X2)) ) ) ) ),
inference(fof_simplification,[status(thm)],[t60_group_2]) ).
cnf(c_0_10,negated_conjecture,
~ r2_hidden(k3_group_1(esk1_0,esk3_0),k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,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_8]) ).
cnf(c_0_12,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_18,plain,
! [X28,X29,X30] :
( r1_rlvect_1(X30,k3_group_1(X28,X29))
| ~ r1_rlvect_1(X30,X29)
| ~ m1_group_2(X30,X28)
| ~ m1_subset_1(X29,u1_struct_0(X28))
| ~ l1_group_1(X28)
| ~ v4_group_1(X28)
| ~ v3_group_1(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_9])])])]) ).
fof(c_0_19,plain,
! [X1,X2] :
( ( m1_subset_1(X2,u1_struct_0(X1))
& l1_group_1(X1)
& v4_group_1(X1)
& v3_group_1(X1)
& ~ v3_struct_0(X1) )
=> m1_subset_1(k3_group_1(X1,X2),u1_struct_0(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k3_group_1]) ).
cnf(c_0_20,negated_conjecture,
( ~ m1_subset_1(k3_group_1(esk1_0,esk3_0),u1_struct_0(esk1_0))
| ~ r1_rlvect_1(esk2_0,k3_group_1(esk1_0,esk3_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(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_21,plain,
( ~ r1_rlvect_1(X3,X2)
| ~ m1_group_2(X3,X1)
| ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| r1_rlvect_1(X3,k3_group_1(X1,X2))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
m1_subset_1(esk3_0,u1_struct_0(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_23,plain,
! [X26,X27] :
( m1_subset_1(k3_group_1(X26,X27),u1_struct_0(X26))
| ~ m1_subset_1(X27,u1_struct_0(X26))
| ~ l1_group_1(X26)
| ~ v4_group_1(X26)
| ~ v3_group_1(X26)
| v3_struct_0(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ m1_subset_1(k3_group_1(esk1_0,esk3_0),u1_struct_0(esk1_0))
| ~ r1_rlvect_1(esk2_0,esk3_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(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_12]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_25,plain,
( ~ m1_subset_1(X2,u1_struct_0(X1))
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| m1_subset_1(k3_group_1(X1,X2),u1_struct_0(X1))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
( ~ l1_group_1(X2)
| ~ v4_group_1(X2)
| ~ v3_group_1(X2)
| ~ m1_group_2(X3,X2)
| ~ v1_group_1(X3)
| ~ m1_subset_1(X1,u1_struct_0(X2))
| ~ r2_hidden(X1,k1_funct_1(k1_latsubgr(X2),X3))
| v3_struct_0(X2)
| r1_rlvect_1(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
r2_hidden(esk3_0,k1_funct_1(k1_latsubgr(esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
~ r1_rlvect_1(esk2_0,esk3_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_24,c_0_25]),c_0_22]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_26,c_0_27]),c_0_22]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_28]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP644+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.50 % Computer : n012.cluster.edu
% 0.03/0.50 % Model : x86_64 x86_64
% 0.03/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.50 % Memory : 8046.5625MB
% 0.03/0.50 % OS : Linux 6.8.0-71-generic
% 0.03/0.50 % CPULimit : 300
% 0.03/0.50 % WCLimit : 300
% 0.03/0.50 % DateTime : Sun Sep 20 20:25:38 UTC 2026
% 0.03/0.50 % CPUTime :
% 0.03/0.50 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.53 Running first-order theorem proving
% 0.08/0.53 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.08/0.55 % Version: 3.5.1
% 0.08/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.08/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.08/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.55 % Starting sh5l with 300s (1) cores
% 0.08/0.55 % new_bool_3 with pid 803682 completed with status 0
% 0.08/0.55 % Result found by new_bool_3
% 0.08/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.08/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.08/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.55 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.08/0.55 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.55 % SubtermCWHack with pid 803686 completed with status 0
% 0.08/0.55 % Result found by SubtermCWHack
% 0.08/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.08/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.08/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.55 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.08/0.55 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.55 % Preprocessing time : 0.001 s
% 0.08/0.55
% 0.08/0.55 % Proof found!
% 0.08/0.55 % SZS status Theorem
% 0.08/0.55 % SZS output start CNFRefutation
% See solution above
% 0.08/0.55 % Parsed axioms : 55
% 0.08/0.55 % Removed by relevancy pruning/SinE : 24
% 0.08/0.55 % Initial clauses : 51
% 0.08/0.55 % Removed in clause preprocessing : 0
% 0.08/0.55 % Initial clauses in saturation : 51
% 0.08/0.55 % Processed clauses : 121
% 0.08/0.55 % ...of these trivial : 0
% 0.08/0.55 % ...subsumed : 19
% 0.08/0.55 % ...remaining for further processing : 102
% 0.08/0.55 % Other redundant clauses eliminated : 0
% 0.08/0.55 % Clauses deleted for lack of memory : 0
% 0.08/0.55 % Backward-subsumed : 2
% 0.08/0.55 % Backward-rewritten : 2
% 0.08/0.55 % Generated clauses : 141
% 0.08/0.55 % ...of the previous two non-redundant : 125
% 0.08/0.55 % ...aggressively subsumed : 0
% 0.08/0.55 % Contextual simplify-reflections : 4
% 0.08/0.55 % Paramodulations : 141
% 0.08/0.55 % Factorizations : 0
% 0.08/0.55 % NegExts : 0
% 0.08/0.55 % Equation resolutions : 0
% 0.08/0.55 % Disequality decompositions : 0
% 0.08/0.55 % Total rewrite steps : 39
% 0.08/0.55 % ...of those cached : 29
% 0.08/0.55 % Propositional unsat checks : 0
% 0.08/0.55 % Propositional check models : 0
% 0.08/0.55 % Propositional check unsatisfiable : 0
% 0.08/0.55 % Propositional clauses : 0
% 0.08/0.55 % Propositional clauses after purity: 0
% 0.08/0.55 % Propositional unsat core size : 0
% 0.08/0.55 % Propositional preprocessing time : 0.000
% 0.08/0.55 % Propositional encoding time : 0.000
% 0.08/0.55 % Propositional solver time : 0.000
% 0.08/0.55 % Success case prop preproc time : 0.000
% 0.08/0.55 % Success case prop encoding time : 0.000
% 0.08/0.55 % Success case prop solver time : 0.000
% 0.08/0.55 % Current number of processed clauses : 98
% 0.08/0.55 % Positive orientable unit clauses : 18
% 0.08/0.55 % Positive unorientable unit clauses: 0
% 0.08/0.55 % Negative unit clauses : 9
% 0.08/0.55 % Non-unit-clauses : 71
% 0.08/0.55 % Current number of unprocessed clauses: 54
% 0.08/0.55 % ...number of literals in the above : 219
% 0.08/0.55 % Current number of archived formulas : 0
% 0.08/0.55 % Current number of archived clauses : 4
% 0.08/0.55 % Clause-clause subsumption calls (NU) : 981
% 0.08/0.55 % Rec. Clause-clause subsumption calls : 418
% 0.08/0.55 % Non-unit clause-clause subsumptions : 24
% 0.08/0.55 % Unit Clause-clause subsumption calls : 60
% 0.08/0.55 % Rewrite failures with RHS unbound : 0
% 0.08/0.55 % BW rewrite match attempts : 1
% 0.08/0.55 % BW rewrite match successes : 1
% 0.08/0.55 % Condensation attempts : 0
% 0.08/0.55 % Condensation successes : 0
% 0.08/0.55 % Termbank termtop insertions : 6408
% 0.08/0.55 % Search garbage collected termcells : 812
% 0.08/0.55
% 0.08/0.55 % -------------------------------------------------
% 0.08/0.55 % User time : 0.007 s
% 0.08/0.55 % System time : 0.003 s
% 0.08/0.55 % Total time : 0.010 s
% 0.08/0.55 % Maximum resident set size: 3644 pages
% 0.08/0.55
% 0.08/0.55 % -------------------------------------------------
% 0.08/0.55 % User time : 0.010 s
% 0.08/0.55 % System time : 0.005 s
% 0.08/0.55 % Total time : 0.015 s
% 0.08/0.55 % Maximum resident set size: 4864 pages
% 0.08/0.55 % E exiting
%------------------------------------------------------------------------------