TSTP Solution File: GRP642+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP642+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:58:22 EDT 2024
% Result : Theorem 3.41s 1.10s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 68 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 74 ( 26 ~; 15 |; 23 &)
% ( 2 <=>; 8 =>; 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 : 22 ( 2 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_latsubgr) ).
fof(t20_latsubgr,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_latsubgr) ).
fof(c_0_3,plain,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_4,plain,
! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t19_latsubgr]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v3_group_1(X1)
& v4_group_1(X1)
& l1_group_1(X1) )
=> ! [X2] :
( ( v1_group_1(X2)
& m1_group_2(X2,X1) )
=> k1_funct_1(k1_latsubgr(X1),X2) != k1_xboole_0 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t20_latsubgr])]) ).
fof(c_0_6,plain,
! [X16,X17,X18] :
( ( X16 != k1_xboole_0
| ~ r2_hidden(X17,X16) )
& ( r2_hidden(esk3_1(X18),X18)
| X18 = 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_3])])])])])]) ).
fof(c_0_7,plain,
! [X161,X162] :
( v3_struct_0(X161)
| ~ v3_group_1(X161)
| ~ v4_group_1(X161)
| ~ l1_group_1(X161)
| ~ v1_group_1(X162)
| ~ m1_group_2(X162,X161)
| r2_hidden(k2_group_1(X161),k1_funct_1(k1_latsubgr(X161),X162)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v3_group_1(esk1_0)
& v4_group_1(esk1_0)
& l1_group_1(esk1_0)
& v1_group_1(esk2_0)
& m1_group_2(esk2_0,esk1_0)
& k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( v3_struct_0(X1)
| r2_hidden(k2_group_1(X1),k1_funct_1(k1_latsubgr(X1),X2))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1)
| ~ v1_group_1(X2)
| ~ m1_group_2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0,
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_8]) ).
cnf(c_0_13,negated_conjecture,
v4_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
v3_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
v1_group_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
l1_group_1(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
~ v3_struct_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_19,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_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP642+2 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 05:06:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.10 # Version: 3.1.0
% 3.41/1.10 # Preprocessing class: FMLLSMLLSSSNFFN.
% 3.41/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.41/1.10 # Starting new_bool_3 with 900s (3) cores
% 3.41/1.10 # Starting new_bool_1 with 900s (3) cores
% 3.41/1.10 # Starting sh5l with 300s (1) cores
% 3.41/1.10 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 3.41/1.10 # new_bool_3 with pid 15600 completed with status 0
% 3.41/1.10 # Result found by new_bool_3
% 3.41/1.10 # Preprocessing class: FMLLSMLLSSSNFFN.
% 3.41/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.41/1.10 # Starting new_bool_3 with 900s (3) cores
% 3.41/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.41/1.10 # Search class: FGHSM-FMLM31-MFFFFFNN
% 3.41/1.10 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 3.41/1.10 # Starting new_ho_10 with 163s (1) cores
% 3.41/1.10 # Starting new_bool_3 with 91s (1) cores
% 3.41/1.10 # Starting ho_unfolding_3 with 163s (1) cores
% 3.41/1.10 # new_ho_10 with pid 15616 completed with status 0
% 3.41/1.10 # Result found by new_ho_10
% 3.41/1.10 # Preprocessing class: FMLLSMLLSSSNFFN.
% 3.41/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.41/1.10 # Starting new_bool_3 with 900s (3) cores
% 3.41/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.41/1.10 # Search class: FGHSM-FMLM31-MFFFFFNN
% 3.41/1.10 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 3.41/1.10 # Starting new_ho_10 with 163s (1) cores
% 3.41/1.10 # Preprocessing time : 0.023 s
% 3.41/1.10 # Presaturation interreduction done
% 3.41/1.10
% 3.41/1.10 # Proof found!
% 3.41/1.10 # SZS status Theorem
% 3.41/1.10 # SZS output start CNFRefutation
% See solution above
% 3.41/1.10 # Parsed axioms : 5659
% 3.41/1.10 # Removed by relevancy pruning/SinE : 5185
% 3.41/1.10 # Initial clauses : 999
% 3.41/1.10 # Removed in clause preprocessing : 48
% 3.41/1.10 # Initial clauses in saturation : 951
% 3.41/1.10 # Processed clauses : 1652
% 3.41/1.10 # ...of these trivial : 15
% 3.41/1.10 # ...subsumed : 188
% 3.41/1.10 # ...remaining for further processing : 1449
% 3.41/1.10 # Other redundant clauses eliminated : 92
% 3.41/1.10 # Clauses deleted for lack of memory : 0
% 3.41/1.10 # Backward-subsumed : 3
% 3.41/1.10 # Backward-rewritten : 24
% 3.41/1.10 # Generated clauses : 2958
% 3.41/1.10 # ...of the previous two non-redundant : 2316
% 3.41/1.10 # ...aggressively subsumed : 0
% 3.41/1.10 # Contextual simplify-reflections : 46
% 3.41/1.10 # Paramodulations : 2867
% 3.41/1.10 # Factorizations : 0
% 3.41/1.10 # NegExts : 0
% 3.41/1.10 # Equation resolutions : 95
% 3.41/1.10 # Disequality decompositions : 0
% 3.41/1.10 # Total rewrite steps : 1322
% 3.41/1.10 # ...of those cached : 891
% 3.41/1.10 # Propositional unsat checks : 0
% 3.41/1.10 # Propositional check models : 0
% 3.41/1.10 # Propositional check unsatisfiable : 0
% 3.41/1.10 # Propositional clauses : 0
% 3.41/1.10 # Propositional clauses after purity: 0
% 3.41/1.10 # Propositional unsat core size : 0
% 3.41/1.10 # Propositional preprocessing time : 0.000
% 3.41/1.10 # Propositional encoding time : 0.000
% 3.41/1.10 # Propositional solver time : 0.000
% 3.41/1.10 # Success case prop preproc time : 0.000
% 3.41/1.10 # Success case prop encoding time : 0.000
% 3.41/1.10 # Success case prop solver time : 0.000
% 3.41/1.10 # Current number of processed clauses : 477
% 3.41/1.10 # Positive orientable unit clauses : 125
% 3.41/1.10 # Positive unorientable unit clauses: 2
% 3.41/1.10 # Negative unit clauses : 39
% 3.41/1.10 # Non-unit-clauses : 311
% 3.41/1.10 # Current number of unprocessed clauses: 2489
% 3.41/1.10 # ...number of literals in the above : 9211
% 3.41/1.10 # Current number of archived formulas : 0
% 3.41/1.10 # Current number of archived clauses : 908
% 3.41/1.10 # Clause-clause subsumption calls (NU) : 570281
% 3.41/1.10 # Rec. Clause-clause subsumption calls : 35778
% 3.41/1.10 # Non-unit clause-clause subsumptions : 147
% 3.41/1.10 # Unit Clause-clause subsumption calls : 2235
% 3.41/1.10 # Rewrite failures with RHS unbound : 0
% 3.41/1.10 # BW rewrite match attempts : 106
% 3.41/1.10 # BW rewrite match successes : 66
% 3.41/1.10 # Condensation attempts : 1653
% 3.41/1.10 # Condensation successes : 11
% 3.41/1.10 # Termbank termtop insertions : 274504
% 3.41/1.10 # Search garbage collected termcells : 57644
% 3.41/1.10
% 3.41/1.10 # -------------------------------------------------
% 3.41/1.10 # User time : 0.428 s
% 3.41/1.10 # System time : 0.024 s
% 3.41/1.10 # Total time : 0.452 s
% 3.41/1.10 # Maximum resident set size: 12124 pages
% 3.41/1.10
% 3.41/1.10 # -------------------------------------------------
% 3.41/1.10 # User time : 1.217 s
% 3.41/1.10 # System time : 0.048 s
% 3.41/1.10 # Total time : 1.265 s
% 3.41/1.10 # Maximum resident set size: 8564 pages
% 3.41/1.10 % E---3.1 exiting
%------------------------------------------------------------------------------