TSTP Solution File: GRP670-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP670-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:42:47 EDT 2023
% Result : Unsatisfiable 123.69s 16.12s
% Output : CNFRefutation 123.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of clauses : 64 ( 64 unt; 0 nHn; 4 RR)
% Number of literals : 64 ( 63 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 135 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c07,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c07) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c05) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c02) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c01) ).
cnf(c08,axiom,
mult(mult(X1,X2),i(X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c08) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c03) ).
cnf(c09,axiom,
mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(mult(mult(X1,mult(X2,X3)),X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c09) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',c06) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(mult(c,b),c)) != mult(mult(a,mult(mult(b,c),b)),c),
file('/export/starexec/sandbox2/tmp/tmp.24kaefravn/E---3.1_29651.p',goals) ).
cnf(c_0_10,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c07 ).
cnf(c_0_11,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_13,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_14,plain,
mult(i(X1),X1) = unit,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
ld(i(X1),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
i(X1) = rd(unit,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,plain,
ld(rd(unit,X1),X2) = mult(X1,X2),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_20,plain,
mult(X1,rd(unit,X1)) = unit,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_22,axiom,
mult(mult(X1,X2),i(X2)) = X1,
c08 ).
cnf(c_0_23,plain,
ld(X1,unit) = rd(unit,X1),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_24,plain,
rd(X1,mult(X2,X1)) = rd(unit,X2),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_25,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_26,plain,
mult(mult(X1,X2),rd(unit,X2)) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_27,axiom,
mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(mult(mult(X1,mult(X2,X3)),X1),X2),
c09 ).
cnf(c_0_28,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_29,plain,
mult(rd(unit,X1),X2) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_23]) ).
cnf(c_0_30,plain,
rd(unit,rd(X1,X2)) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
ld(mult(X1,X2),X1) = rd(unit,X2),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_32,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_27]),c_0_11]),c_0_11]),c_0_28]) ).
cnf(c_0_33,plain,
mult(X1,rd(unit,X2)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_34,plain,
ld(rd(X1,X2),X3) = mult(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
rd(unit,ld(X1,X2)) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_31,c_0_19]) ).
cnf(c_0_36,plain,
rd(X1,unit) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_37,plain,
rd(X1,rd(unit,X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_38,plain,
mult(X1,ld(X2,X1)) = mult(rd(X1,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29]) ).
cnf(c_0_39,plain,
ld(ld(X1,X2),X3) = mult(ld(X2,X1),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
rd(ld(X1,X2),X2) = rd(unit,X1),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_41,plain,
mult(mult(X1,mult(mult(X2,X3),X1)),X2) = mult(mult(X1,X2),mult(X3,mult(X1,X2))),
inference(rw,[status(thm)],[c_0_27,c_0_32]) ).
cnf(c_0_42,plain,
rd(X1,rd(X2,X3)) = mult(X1,rd(X3,X2)),
inference(spm,[status(thm)],[c_0_37,c_0_30]) ).
cnf(c_0_43,plain,
mult(rd(X1,mult(X1,X2)),X1) = rd(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_33]) ).
cnf(c_0_44,plain,
mult(ld(X1,X2),mult(ld(X2,X1),X3)) = X3,
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_45,plain,
rd(X1,ld(X2,X3)) = mult(X1,ld(X3,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_46,plain,
rd(rd(unit,X1),X2) = rd(unit,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_40,c_0_31]) ).
cnf(c_0_47,plain,
mult(ld(X1,rd(X2,X3)),X4) = ld(mult(rd(X3,X2),X1),X4),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_48,plain,
mult(mult(X1,mult(rd(X2,X3),X1)),X2) = mult(rd(mult(X1,X2),X3),mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_29]),c_0_38]) ).
cnf(c_0_49,plain,
mult(X1,rd(rd(X2,X3),X4)) = rd(X1,mult(X4,rd(X3,X2))),
inference(spm,[status(thm)],[c_0_42,c_0_42]) ).
cnf(c_0_50,plain,
mult(rd(ld(X1,X2),X3),ld(X1,X2)) = rd(ld(X1,X2),mult(ld(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
rd(unit,mult(ld(X1,X2),X3)) = ld(X3,ld(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_29]) ).
cnf(c_0_52,plain,
mult(ld(X1,X2),mult(X3,ld(X1,X2))) = ld(mult(rd(X1,mult(X2,X3)),X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_29]),c_0_47]),c_0_29]),c_0_29]) ).
cnf(c_0_53,plain,
ld(mult(X1,ld(X2,X3)),X4) = mult(rd(ld(X3,X2),X1),X4),
inference(spm,[status(thm)],[c_0_34,c_0_45]) ).
cnf(c_0_54,plain,
rd(ld(X1,X2),mult(ld(X2,X1),X3)) = ld(mult(X1,mult(rd(X3,X2),X1)),X2),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_33]),c_0_49]),c_0_46]),c_0_32]),c_0_29]),c_0_29]),c_0_29]),c_0_50]) ).
cnf(c_0_55,plain,
ld(mult(X1,mult(rd(X2,X3),X1)),X3) = ld(X1,mult(rd(X3,mult(X1,X2)),X3)),
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_51,c_0_52]),c_0_45]),c_0_28]),c_0_53]),c_0_50]),c_0_54]) ).
cnf(c_0_56,plain,
ld(mult(rd(X1,mult(X2,X3)),X1),X2) = ld(X1,mult(X2,mult(rd(X3,X1),X2))),
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_55,c_0_46]),c_0_29]),c_0_38]),c_0_33]),c_0_42]),c_0_32]) ).
cnf(c_0_57,plain,
mult(rd(mult(X1,X2),mult(X3,X2)),mult(X1,X2)) = mult(mult(rd(X1,X3),X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_24]),c_0_29]),c_0_38]) ).
cnf(c_0_58,plain,
ld(mult(mult(rd(X1,X2),X1),X3),X2) = ld(mult(X1,X3),mult(rd(X2,X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_24]),c_0_29]),c_0_38]) ).
cnf(c_0_59,negated_conjecture,
mult(mult(a,b),mult(mult(c,b),c)) != mult(mult(a,mult(mult(b,c),b)),c),
goals ).
cnf(c_0_60,plain,
mult(rd(X1,mult(rd(X2,X3),X2)),X3) = mult(rd(X1,X2),mult(rd(X3,X2),X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_33]),c_0_34]),c_0_33]),c_0_34]) ).
cnf(c_0_61,negated_conjecture,
mult(mult(a,mult(b,mult(c,b))),c) != mult(mult(a,b),mult(c,mult(b,c))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_32]),c_0_32]) ).
cnf(c_0_62,plain,
mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_46]),c_0_33]),c_0_46]),c_0_42]),c_0_36]),c_0_42]),c_0_36]),c_0_42]),c_0_36]),c_0_32]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP670-1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:30:53 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/tmp/tmp.24kaefravn/E---3.1_29651.p
% 123.69/16.12 # Version: 3.1pre001
% 123.69/16.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 123.69/16.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 123.69/16.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 123.69/16.12 # Starting new_bool_3 with 300s (1) cores
% 123.69/16.12 # Starting new_bool_1 with 300s (1) cores
% 123.69/16.12 # Starting sh5l with 300s (1) cores
% 123.69/16.12 # sh5l with pid 29732 completed with status 0
% 123.69/16.12 # Result found by sh5l
% 123.69/16.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 123.69/16.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 123.69/16.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 123.69/16.12 # Starting new_bool_3 with 300s (1) cores
% 123.69/16.12 # Starting new_bool_1 with 300s (1) cores
% 123.69/16.12 # Starting sh5l with 300s (1) cores
% 123.69/16.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 123.69/16.12 # Search class: FUUPM-FFSF21-MFFFFFNN
% 123.69/16.12 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 123.69/16.12 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 123.69/16.12 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 29739 completed with status 0
% 123.69/16.12 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 123.69/16.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 123.69/16.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 123.69/16.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 123.69/16.12 # Starting new_bool_3 with 300s (1) cores
% 123.69/16.12 # Starting new_bool_1 with 300s (1) cores
% 123.69/16.12 # Starting sh5l with 300s (1) cores
% 123.69/16.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 123.69/16.12 # Search class: FUUPM-FFSF21-MFFFFFNN
% 123.69/16.12 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 123.69/16.12 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 123.69/16.12 # Preprocessing time : 0.001 s
% 123.69/16.12 # Presaturation interreduction done
% 123.69/16.12
% 123.69/16.12 # Proof found!
% 123.69/16.12 # SZS status Unsatisfiable
% 123.69/16.12 # SZS output start CNFRefutation
% See solution above
% 123.69/16.12 # Parsed axioms : 10
% 123.69/16.12 # Removed by relevancy pruning/SinE : 0
% 123.69/16.12 # Initial clauses : 10
% 123.69/16.12 # Removed in clause preprocessing : 0
% 123.69/16.12 # Initial clauses in saturation : 10
% 123.69/16.12 # Processed clauses : 4741
% 123.69/16.12 # ...of these trivial : 3645
% 123.69/16.12 # ...subsumed : 0
% 123.69/16.12 # ...remaining for further processing : 1096
% 123.69/16.12 # Other redundant clauses eliminated : 0
% 123.69/16.12 # Clauses deleted for lack of memory : 0
% 123.69/16.12 # Backward-subsumed : 0
% 123.69/16.12 # Backward-rewritten : 144
% 123.69/16.12 # Generated clauses : 635714
% 123.69/16.12 # ...of the previous two non-redundant : 529344
% 123.69/16.12 # ...aggressively subsumed : 0
% 123.69/16.12 # Contextual simplify-reflections : 0
% 123.69/16.12 # Paramodulations : 635714
% 123.69/16.12 # Factorizations : 0
% 123.69/16.12 # NegExts : 0
% 123.69/16.12 # Equation resolutions : 0
% 123.69/16.12 # Total rewrite steps : 3548129
% 123.69/16.12 # Propositional unsat checks : 0
% 123.69/16.12 # Propositional check models : 0
% 123.69/16.12 # Propositional check unsatisfiable : 0
% 123.69/16.12 # Propositional clauses : 0
% 123.69/16.12 # Propositional clauses after purity: 0
% 123.69/16.12 # Propositional unsat core size : 0
% 123.69/16.12 # Propositional preprocessing time : 0.000
% 123.69/16.12 # Propositional encoding time : 0.000
% 123.69/16.12 # Propositional solver time : 0.000
% 123.69/16.12 # Success case prop preproc time : 0.000
% 123.69/16.12 # Success case prop encoding time : 0.000
% 123.69/16.12 # Success case prop solver time : 0.000
% 123.69/16.12 # Current number of processed clauses : 942
% 123.69/16.12 # Positive orientable unit clauses : 942
% 123.69/16.12 # Positive unorientable unit clauses: 0
% 123.69/16.12 # Negative unit clauses : 0
% 123.69/16.12 # Non-unit-clauses : 0
% 123.69/16.12 # Current number of unprocessed clauses: 524132
% 123.69/16.12 # ...number of literals in the above : 524132
% 123.69/16.12 # Current number of archived formulas : 0
% 123.69/16.12 # Current number of archived clauses : 154
% 123.69/16.12 # Clause-clause subsumption calls (NU) : 0
% 123.69/16.12 # Rec. Clause-clause subsumption calls : 0
% 123.69/16.12 # Non-unit clause-clause subsumptions : 0
% 123.69/16.12 # Unit Clause-clause subsumption calls : 0
% 123.69/16.12 # Rewrite failures with RHS unbound : 0
% 123.69/16.12 # BW rewrite match attempts : 9059
% 123.69/16.12 # BW rewrite match successes : 132
% 123.69/16.12 # Condensation attempts : 0
% 123.69/16.12 # Condensation successes : 0
% 123.69/16.12 # Termbank termtop insertions : 15458751
% 123.69/16.12
% 123.69/16.12 # -------------------------------------------------
% 123.69/16.12 # User time : 14.807 s
% 123.69/16.12 # System time : 0.584 s
% 123.69/16.12 # Total time : 15.391 s
% 123.69/16.12 # Maximum resident set size: 1608 pages
% 123.69/16.12
% 123.69/16.12 # -------------------------------------------------
% 123.69/16.12 # User time : 14.808 s
% 123.69/16.12 # System time : 0.587 s
% 123.69/16.12 # Total time : 15.394 s
% 123.69/16.12 # Maximum resident set size: 1676 pages
% 123.69/16.12 % E---3.1 exiting
% 123.69/16.12 % E---3.1 exiting
%------------------------------------------------------------------------------