%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP642+3 : 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:31 PM UTC 2026
% Result : Theorem 1.48s 6.09s
% Output : CNFRefutation 1.48s
% 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/sandbox2/benchmark/theBenchmark.p',t20_latsubgr) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox2/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/sandbox2/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,
! [X17,X18,X19] :
( ( X19 = k1_xboole_0
| r2_hidden(esk3_1(X19),X19) )
& ( ~ r2_hidden(X18,X17)
| X17 != 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,
! [X117,X118] :
( r2_hidden(k2_group_1(X117),k1_funct_1(k1_latsubgr(X117),X118))
| ~ m1_group_2(X118,X117)
| ~ v1_group_1(X118)
| ~ l1_group_1(X117)
| ~ v4_group_1(X117)
| ~ v3_group_1(X117)
| v3_struct_0(X117) ),
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.02 % Problem : GRP642+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.36 % Computer : n012.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sun Sep 20 20:25:06 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.09/5.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.40 Running first-order theorem proving
% 0.14/5.40 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.48/6.09 % Version: 3.5.1
% 1.48/6.09 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.48/6.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/6.09 % Starting new_bool_3 with 900s (3) cores
% 1.48/6.09 % Starting new_bool_1 with 900s (3) cores
% 1.48/6.09 % Starting sh5l with 300s (1) cores
% 1.48/6.09 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.48/6.09 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 801664 completed with status 0
% 1.48/6.09 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 1.48/6.09 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.48/6.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/6.09 % Starting new_bool_3 with 900s (3) cores
% 1.48/6.09 % Starting new_bool_1 with 900s (3) cores
% 1.48/6.09 % Starting sh5l with 300s (1) cores
% 1.48/6.09 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.48/6.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.48/6.09 % SinE strategy is gf120_gu_R02_F100_L20000
% 1.48/6.09 % Search class: FGHSM-FSLM31-SFFFFFNN
% 1.48/6.09 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.48/6.09 % Starting SubtermCWHack with 28s (1) cores
% 1.48/6.09 % SubtermCWHack with pid 801665 completed with status 0
% 1.48/6.09 % Result found by SubtermCWHack
% 1.48/6.09 % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.48/6.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/6.09 % Starting new_bool_3 with 900s (3) cores
% 1.48/6.09 % Starting new_bool_1 with 900s (3) cores
% 1.48/6.09 % Starting sh5l with 300s (1) cores
% 1.48/6.09 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 1.48/6.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.48/6.09 % SinE strategy is gf120_gu_R02_F100_L20000
% 1.48/6.09 % Search class: FGHSM-FSLM31-SFFFFFNN
% 1.48/6.09 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.48/6.09 % Starting SubtermCWHack with 28s (1) cores
% 1.48/6.09 % Preprocessing time : 0.011 s
% 1.48/6.09
% 1.48/6.09 % Proof found!
% 1.48/6.09 % SZS status Theorem
% 1.48/6.09 % SZS output start CNFRefutation
% See solution above
% 1.48/6.09 % Parsed axioms : 13984
% 1.48/6.09 % Removed by relevancy pruning/SinE : 13849
% 1.48/6.09 % Initial clauses : 248
% 1.48/6.09 % Removed in clause preprocessing : 10
% 1.48/6.09 % Initial clauses in saturation : 238
% 1.48/6.09 % Processed clauses : 847
% 1.48/6.09 % ...of these trivial : 9
% 1.48/6.09 % ...subsumed : 438
% 1.48/6.09 % ...remaining for further processing : 400
% 1.48/6.09 % Other redundant clauses eliminated : 24
% 1.48/6.09 % Clauses deleted for lack of memory : 0
% 1.48/6.09 % Backward-subsumed : 7
% 1.48/6.09 % Backward-rewritten : 10
% 1.48/6.09 % Generated clauses : 2564
% 1.48/6.09 % ...of the previous two non-redundant : 1980
% 1.48/6.09 % ...aggressively subsumed : 0
% 1.48/6.09 % Contextual simplify-reflections : 6
% 1.48/6.09 % Paramodulations : 2535
% 1.48/6.09 % Factorizations : 2
% 1.48/6.09 % NegExts : 0
% 1.48/6.09 % Equation resolutions : 27
% 1.48/6.09 % Disequality decompositions : 0
% 1.48/6.09 % Total rewrite steps : 965
% 1.48/6.09 % ...of those cached : 897
% 1.48/6.09 % Propositional unsat checks : 0
% 1.48/6.09 % Propositional check models : 0
% 1.48/6.09 % Propositional check unsatisfiable : 0
% 1.48/6.09 % Propositional clauses : 0
% 1.48/6.09 % Propositional clauses after purity: 0
% 1.48/6.09 % Propositional unsat core size : 0
% 1.48/6.09 % Propositional preprocessing time : 0.000
% 1.48/6.09 % Propositional encoding time : 0.000
% 1.48/6.09 % Propositional solver time : 0.000
% 1.48/6.09 % Success case prop preproc time : 0.000
% 1.48/6.09 % Success case prop encoding time : 0.000
% 1.48/6.09 % Success case prop solver time : 0.000
% 1.48/6.09 % Current number of processed clauses : 371
% 1.48/6.09 % Positive orientable unit clauses : 56
% 1.48/6.09 % Positive unorientable unit clauses: 0
% 1.48/6.09 % Negative unit clauses : 24
% 1.48/6.09 % Non-unit-clauses : 291
% 1.48/6.09 % Current number of unprocessed clauses: 1356
% 1.48/6.09 % ...number of literals in the above : 4875
% 1.48/6.09 % Current number of archived formulas : 0
% 1.48/6.09 % Current number of archived clauses : 17
% 1.48/6.09 % Clause-clause subsumption calls (NU) : 16542
% 1.48/6.09 % Rec. Clause-clause subsumption calls : 7422
% 1.48/6.09 % Non-unit clause-clause subsumptions : 327
% 1.48/6.09 % Unit Clause-clause subsumption calls : 1924
% 1.48/6.09 % Rewrite failures with RHS unbound : 0
% 1.48/6.09 % BW rewrite match attempts : 30
% 1.48/6.09 % BW rewrite match successes : 5
% 1.48/6.09 % Condensation attempts : 0
% 1.48/6.09 % Condensation successes : 0
% 1.48/6.09 % Termbank termtop insertions : 390645
% 1.48/6.09 % Search garbage collected termcells : 125003
% 1.48/6.09
% 1.48/6.09 % -------------------------------------------------
% 1.48/6.09 % User time : 0.153 s
% 1.48/6.09 % System time : 0.055 s
% 1.48/6.09 % Total time : 0.208 s
% 1.48/6.09 % Maximum resident set size: 28872 pages
% 1.48/6.09
% 1.48/6.09 % -------------------------------------------------
% 1.48/6.09 % User time : 0.570 s
% 1.48/6.09 % System time : 0.083 s
% 1.48/6.09 % Total time : 0.653 s
% 1.48/6.09 % Maximum resident set size: 23808 pages
% 1.48/6.09 % E exiting
%------------------------------------------------------------------------------