%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP642+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 0.37s 0.89s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 75 ( 10 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 83 ( 29 ~; 15 |; 27 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 2 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t20_latsubgr) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',d1_xboole_0) ).
fof(t19_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) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_latsubgr) ).
fof(c_0_3,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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
inference(assume_negation,[status(cth)],[t20_latsubgr]) ).
fof(c_0_4,plain,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_5,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) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t19_latsubgr]) ).
fof(c_0_6,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) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X16,X17,X18] :
( ( X18 = k1_xboole_0
| r2_hidden(esk3_1(X18),X18) )
& ( ~ r2_hidden(X17,X16)
| X16 != k1_xboole_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_8,plain,
! [X161,X162] :
( r2_hidden(k2_group_1(X161),k1_funct_1(k1_latsubgr(X161),X162))
| ~ m1_group_2(X162,X161)
| ~ v1_group_1(X162)
| ~ l1_group_1(X161)
| ~ v4_group_1(X161)
| ~ v3_group_1(X161)
| v3_struct_0(X161) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,negated_conjecture,
( k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_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_6])])])]) ).
cnf(c_0_10,plain,
( ~ r2_hidden(X2,X1)
| X1 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ m1_group_2(X2,X1)
| ~ v1_group_1(X2)
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1)
| r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2))
| v3_struct_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_20,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(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17])]),c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP642+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n004.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Sun Sep 20 20:25:24 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.37/0.89 % Version: 3.5.1
% 0.37/0.89 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.37/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.89 % Starting new_bool_3 with 900s (3) cores
% 0.37/0.89 % Starting new_bool_1 with 900s (3) cores
% 0.37/0.89 % Starting sh5l with 300s (1) cores
% 0.37/0.89 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 0.37/0.89 % new_bool_3 with pid 1421031 completed with status 0
% 0.37/0.89 % Result found by new_bool_3
% 0.37/0.89 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.37/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.89 % Starting new_bool_3 with 900s (3) cores
% 0.37/0.89 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/0.89 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.89 % Search class: FGHSM-FMLM31-MFFFFFNN
% 0.37/0.89 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.37/0.89 % Starting SubtermCWHack with 82s (1) cores
% 0.37/0.89 % Starting new_bool_3 with 91s (1) cores
% 0.37/0.89 % Starting sh3 with 163s (1) cores
% 0.37/0.89 % SubtermCWHack with pid 1421087 completed with status 0
% 0.37/0.89 % Result found by SubtermCWHack
% 0.37/0.89 % Preprocessing class: FMLLSMLLSSSNFFN.
% 0.37/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.89 % Starting new_bool_3 with 900s (3) cores
% 0.37/0.89 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.37/0.89 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.89 % Search class: FGHSM-FMLM31-MFFFFFNN
% 0.37/0.89 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 0.37/0.89 % Starting SubtermCWHack with 82s (1) cores
% 0.37/0.89 % Preprocessing time : 0.014 s
% 0.37/0.89
% 0.37/0.89 % Proof found!
% 0.37/0.89 % SZS status Theorem
% 0.37/0.89 % SZS output start CNFRefutation
% See solution above
% 0.37/0.89 % Parsed axioms : 5659
% 0.37/0.89 % Removed by relevancy pruning/SinE : 5185
% 0.37/0.89 % Initial clauses : 999
% 0.37/0.89 % Removed in clause preprocessing : 48
% 0.37/0.89 % Initial clauses in saturation : 951
% 0.37/0.89 % Processed clauses : 3542
% 0.37/0.89 % ...of these trivial : 123
% 0.37/0.89 % ...subsumed : 2319
% 0.37/0.89 % ...remaining for further processing : 1100
% 0.37/0.89 % Other redundant clauses eliminated : 77
% 0.37/0.89 % Clauses deleted for lack of memory : 0
% 0.37/0.89 % Backward-subsumed : 23
% 0.37/0.89 % Backward-rewritten : 62
% 0.37/0.89 % Generated clauses : 11627
% 0.37/0.89 % ...of the previous two non-redundant : 9045
% 0.37/0.89 % ...aggressively subsumed : 0
% 0.37/0.89 % Contextual simplify-reflections : 3
% 0.37/0.89 % Paramodulations : 11546
% 0.37/0.89 % Factorizations : 2
% 0.37/0.89 % NegExts : 0
% 0.37/0.89 % Equation resolutions : 81
% 0.37/0.89 % Disequality decompositions : 0
% 0.37/0.89 % Total rewrite steps : 4073
% 0.37/0.89 % ...of those cached : 3299
% 0.37/0.89 % Propositional unsat checks : 0
% 0.37/0.89 % Propositional check models : 0
% 0.37/0.89 % Propositional check unsatisfiable : 0
% 0.37/0.89 % Propositional clauses : 0
% 0.37/0.89 % Propositional clauses after purity: 0
% 0.37/0.89 % Propositional unsat core size : 0
% 0.37/0.89 % Propositional preprocessing time : 0.000
% 0.37/0.89 % Propositional encoding time : 0.000
% 0.37/0.89 % Propositional solver time : 0.000
% 0.37/0.89 % Success case prop preproc time : 0.000
% 0.37/0.89 % Success case prop encoding time : 0.000
% 0.37/0.89 % Success case prop solver time : 0.000
% 0.37/0.89 % Current number of processed clauses : 985
% 0.37/0.89 % Positive orientable unit clauses : 209
% 0.37/0.89 % Positive unorientable unit clauses: 2
% 0.37/0.89 % Negative unit clauses : 152
% 0.37/0.89 % Non-unit-clauses : 622
% 0.37/0.89 % Current number of unprocessed clauses: 6348
% 0.37/0.89 % ...number of literals in the above : 18545
% 0.37/0.89 % Current number of archived formulas : 0
% 0.37/0.89 % Current number of archived clauses : 85
% 0.37/0.89 % Clause-clause subsumption calls (NU) : 163102
% 0.37/0.89 % Rec. Clause-clause subsumption calls : 67644
% 0.37/0.89 % Non-unit clause-clause subsumptions : 843
% 0.37/0.89 % Unit Clause-clause subsumption calls : 18248
% 0.37/0.89 % Rewrite failures with RHS unbound : 0
% 0.37/0.89 % BW rewrite match attempts : 158
% 0.37/0.89 % BW rewrite match successes : 57
% 0.37/0.89 % Condensation attempts : 0
% 0.37/0.89 % Condensation successes : 0
% 0.37/0.89 % Termbank termtop insertions : 303345
% 0.37/0.89 % Search garbage collected termcells : 57643
% 0.37/0.89
% 0.37/0.89 % -------------------------------------------------
% 0.37/0.89 % User time : 0.222 s
% 0.37/0.89 % System time : 0.027 s
% 0.37/0.89 % Total time : 0.249 s
% 0.37/0.89 % Maximum resident set size: 13868 pages
% 0.37/0.89
% 0.37/0.89 % -------------------------------------------------
% 0.37/0.89 % User time : 0.691 s
% 0.37/0.89 % System time : 0.070 s
% 0.37/0.89 % Total time : 0.761 s
% 0.37/0.89 % Maximum resident set size: 11520 pages
% 0.37/0.89 % E exiting
%------------------------------------------------------------------------------