TSTP Solution File: GRP659+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP659+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:50:34 EDT 2024
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 47 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 0 con; 1-2 aty)
% Number of variables : 100 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f05,axiom,
! [X3,X1,X2] : mult(mult(X2,mult(X1,X3)),X1) = mult(mult(X2,X1),mult(X3,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
fof(goals,conjecture,
? [X4] :
! [X5] :
( mult(X5,X4) = X5
& mult(X4,X5) = X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_6,plain,
! [X15,X16] : rd(mult(X16,X15),X15) = X16,
inference(variable_rename,[status(thm)],[f04]) ).
fof(c_0_7,plain,
! [X17,X18,X19] : mult(mult(X19,mult(X18,X17)),X18) = mult(mult(X19,X18),mult(X17,X18)),
inference(variable_rename,[status(thm)],[f05]) ).
cnf(c_0_8,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
mult(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X2),mult(X3,X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X13,X14] : mult(rd(X14,X13),X13) = X14,
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_11,plain,
rd(mult(mult(X1,X2),mult(X3,X2)),X2) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
rd(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,rd(X3,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X11,X12] : ld(X12,mult(X12,X11)) = X11,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_15,plain,
rd(mult(X1,X2),X3) = mult(rd(X1,X3),mult(X3,rd(X2,X3))),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
fof(c_0_16,plain,
! [X9,X10] : mult(X10,ld(X10,X9)) = X9,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_17,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
mult(rd(rd(X1,X2),X3),mult(X3,rd(X2,X3))) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
mult(X1,mult(X2,rd(X2,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_21,plain,
ld(rd(rd(X1,X2),X3),rd(X1,X3)) = mult(X3,rd(X2,X3)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_23,plain,
mult(X1,rd(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_17]) ).
cnf(c_0_24,plain,
mult(X1,rd(ld(X2,X3),X1)) = ld(rd(X2,X1),rd(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
rd(X1,X1) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_26,plain,
rd(ld(X1,X2),X3) = ld(X3,ld(rd(X1,X3),rd(X2,X3))),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,plain,
ld(ld(X1,ld(rd(X2,X1),rd(X2,X1))),rd(X2,X1)) = mult(X1,rd(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_26]) ).
cnf(c_0_28,plain,
ld(ld(ld(X1,X2),ld(X1,X1)),X1) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_29,plain,
ld(ld(X1,ld(X2,X2)),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_30,plain,
mult(ld(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_31,plain,
mult(ld(X1,ld(X2,X2)),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_32,plain,
ld(rd(rd(X1,X2),X1),ld(X1,X1)) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_33,plain,
mult(mult(X1,ld(X2,X2)),X2) = mult(mult(X1,X2),ld(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_30]),c_0_19]) ).
cnf(c_0_34,plain,
mult(mult(X1,rd(X2,X1)),rd(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_12]) ).
cnf(c_0_35,plain,
rd(X1,mult(X2,X1)) = ld(X2,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_36,plain,
mult(mult(X1,X1),ld(X1,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_37,plain,
mult(mult(X1,X2),ld(X2,ld(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15]),c_0_25]),c_0_19]),c_0_12]) ).
cnf(c_0_38,plain,
ld(mult(X1,X1),mult(X1,X1)) = ld(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_39,plain,
ld(mult(X1,X2),X1) = ld(X2,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_40,plain,
mult(ld(X1,X1),mult(X1,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_38]) ).
fof(c_0_41,negated_conjecture,
~ ? [X4] :
! [X5] :
( mult(X5,X4) = X5
& mult(X4,X5) = X5 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_42,plain,
rd(X1,ld(X2,ld(X1,X1))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_43,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_40]),c_0_25]),c_0_38]),c_0_38]) ).
fof(c_0_44,negated_conjecture,
! [X6] :
( mult(esk1_1(X6),X6) != esk1_1(X6)
| mult(X6,esk2_1(X6)) != esk2_1(X6) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])]) ).
cnf(c_0_45,plain,
mult(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22]) ).
cnf(c_0_46,negated_conjecture,
( mult(esk1_1(X1),X1) != esk1_1(X1)
| mult(X1,esk2_1(X1)) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_47,plain,
ld(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
mult(esk1_1(ld(X1,X1)),ld(X1,X1)) != esk1_1(ld(X1,X1)),
inference(spm,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_49,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_47]),c_0_22]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP659+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n009.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 04:28:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.18/0.50 # Version: 3.1.0
% 0.18/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # sh5l with pid 10514 completed with status 0
% 0.18/0.50 # Result found by sh5l
% 0.18/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.50 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.18/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.18/0.50 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 10522 completed with status 0
% 0.18/0.50 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.18/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.50 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.18/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.18/0.50 # Preprocessing time : 0.001 s
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 6
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 6
% 0.18/0.50 # Removed in clause preprocessing : 0
% 0.18/0.50 # Initial clauses in saturation : 6
% 0.18/0.50 # Processed clauses : 65
% 0.18/0.50 # ...of these trivial : 10
% 0.18/0.50 # ...subsumed : 1
% 0.18/0.50 # ...remaining for further processing : 54
% 0.18/0.50 # Other redundant clauses eliminated : 0
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 0
% 0.18/0.50 # Backward-rewritten : 21
% 0.18/0.50 # Generated clauses : 810
% 0.18/0.50 # ...of the previous two non-redundant : 604
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 0
% 0.18/0.50 # Paramodulations : 810
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 0
% 0.18/0.50 # Disequality decompositions : 0
% 0.18/0.50 # Total rewrite steps : 927
% 0.18/0.50 # ...of those cached : 632
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 33
% 0.18/0.50 # Positive orientable unit clauses : 32
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 0
% 0.18/0.50 # Non-unit-clauses : 1
% 0.18/0.50 # Current number of unprocessed clauses: 531
% 0.18/0.50 # ...number of literals in the above : 531
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 21
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.50 # Non-unit clause-clause subsumptions : 0
% 0.18/0.50 # Unit Clause-clause subsumption calls : 1
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 61
% 0.18/0.50 # BW rewrite match successes : 22
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 9815
% 0.18/0.50 # Search garbage collected termcells : 30
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.014 s
% 0.18/0.50 # System time : 0.002 s
% 0.18/0.50 # Total time : 0.016 s
% 0.18/0.50 # Maximum resident set size: 1592 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.015 s
% 0.18/0.50 # System time : 0.004 s
% 0.18/0.50 # Total time : 0.019 s
% 0.18/0.50 # Maximum resident set size: 1684 pages
% 0.18/0.50 % E---3.1 exiting
% 0.18/0.50 % E exiting
%------------------------------------------------------------------------------