TSTP Solution File: GRP754-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP754-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:43:16 EDT 2023
% Result : Unsatisfiable 1.87s 0.77s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 3 RR)
% Number of literals : 51 ( 50 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 137 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f06,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',f06) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',f03) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',f04) ).
cnf(f05,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',f05) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',f01) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',f02) ).
cnf(goals,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
file('/export/starexec/sandbox/tmp/tmp.sJh5epCmqg/E---3.1_31784.p',goals) ).
cnf(c_0_7,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),mult(X2,ld(X3,X3))),
f06 ).
cnf(c_0_8,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_9,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_10,plain,
mult(mult(rd(X1,X2),X3),X2) = mult(X1,mult(X3,ld(X2,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
rd(mult(X1,mult(X2,ld(X3,X3))),X3) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
mult(X1,mult(X2,X3)) = mult(mult(rd(X1,X1),X2),mult(X1,X3)),
f05 ).
cnf(c_0_13,plain,
mult(rd(rd(X1,mult(X2,ld(X3,X3))),X3),X2) = rd(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,plain,
rd(mult(X1,mult(X2,X3)),mult(X1,X3)) = mult(rd(X1,X1),X2),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
mult(rd(mult(rd(X1,X1),X2),X3),X1) = mult(rd(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]) ).
cnf(c_0_16,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_17,plain,
mult(rd(X1,X2),ld(rd(X1,X1),X3)) = mult(rd(X3,X2),X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_19,plain,
mult(rd(X1,ld(X2,X3)),X3) = mult(X2,ld(rd(X3,X3),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_21,plain,
mult(X1,ld(rd(X2,X2),mult(X3,ld(X1,X2)))) = mult(X3,X2),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_22,plain,
ld(rd(X1,X1),mult(X2,ld(X3,X1))) = ld(X3,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
ld(mult(X1,X2),mult(mult(X1,X3),X2)) = mult(X3,ld(X2,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_24,plain,
mult(rd(X1,X1),ld(X2,mult(X3,X1))) = mult(X3,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_25,plain,
mult(ld(X1,X2),ld(X3,X3)) = ld(mult(X1,X3),mult(X2,X3)),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_26,plain,
mult(X1,ld(mult(X2,X1),mult(mult(X3,X1),X1))) = mult(mult(X3,ld(X2,X1)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_25]) ).
cnf(c_0_27,plain,
ld(mult(X1,X2),mult(mult(X3,X2),X2)) = ld(X2,mult(mult(X3,ld(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_28,plain,
mult(mult(X1,X2),ld(mult(X3,X2),mult(X4,X2))) = mult(mult(X1,ld(X3,X4)),X2),
inference(spm,[status(thm)],[c_0_7,c_0_25]) ).
cnf(c_0_29,plain,
mult(mult(X1,X2),ld(X2,mult(mult(X3,ld(X1,X2)),X2))) = mult(mult(X3,X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_30,plain,
mult(mult(X1,ld(rd(X2,X3),X4)),X3) = mult(mult(X1,X3),ld(X2,mult(X4,X3))),
inference(spm,[status(thm)],[c_0_28,c_0_8]) ).
cnf(c_0_31,plain,
mult(X1,ld(X2,mult(mult(X3,X2),ld(X1,mult(X2,X2))))) = mult(mult(X3,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_8]) ).
cnf(c_0_32,plain,
mult(X1,ld(X2,mult(X3,ld(X1,mult(X2,X2))))) = mult(X3,X2),
inference(spm,[status(thm)],[c_0_31,c_0_8]) ).
cnf(c_0_33,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_34,plain,
mult(rd(X1,ld(X2,mult(rd(X1,X1),X3))),X3) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_35,plain,
mult(rd(mult(X1,X1),X2),ld(X1,mult(X3,X2))) = mult(X3,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
rd(X1,ld(X2,mult(rd(X1,X1),X3))) = rd(mult(X2,X1),X3),
inference(spm,[status(thm)],[c_0_9,c_0_34]) ).
cnf(c_0_37,plain,
rd(mult(X1,X2),ld(X2,mult(X1,X3))) = rd(mult(X2,X2),X3),
inference(spm,[status(thm)],[c_0_9,c_0_35]) ).
cnf(c_0_38,plain,
mult(mult(rd(X1,X1),X2),X3) = mult(X1,mult(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_39,plain,
mult(rd(X1,X1),rd(X2,X3)) = rd(mult(X1,X2),mult(X1,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_40,plain,
ld(X1,mult(X2,ld(X3,mult(X1,X1)))) = ld(X3,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_32]) ).
cnf(c_0_41,plain,
rd(mult(rd(X1,X1),X2),ld(X3,X1)) = rd(mult(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_22]),c_0_36]) ).
cnf(c_0_42,plain,
mult(rd(mult(X1,X1),X2),X3) = mult(rd(mult(X1,X3),X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_37]),c_0_36]) ).
cnf(c_0_43,plain,
mult(rd(mult(X1,X2),mult(X1,X3)),X4) = mult(X1,mult(rd(X2,X3),ld(X1,X4))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
rd(mult(X1,X2),ld(X3,mult(X1,X1))) = rd(mult(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40]),c_0_36]) ).
cnf(c_0_45,plain,
mult(rd(X1,X2),rd(X3,X2)) = rd(mult(X1,X3),mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),c_0_11]) ).
cnf(c_0_46,plain,
rd(mult(X1,mult(X2,X3)),mult(X3,X3)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_45,c_0_9]) ).
cnf(c_0_47,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X2)) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
goals ).
cnf(c_0_49,plain,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,X2),mult(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_47]) ).
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.06/0.12 % Problem : GRP754-1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 03:14:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/tmp/tmp.sJh5epCmqg/E---3.1_31784.p
% 1.87/0.77 # Version: 3.1pre001
% 1.87/0.77 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.87/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.87/0.77 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.87/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.87/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.87/0.77 # Starting sh5l with 300s (1) cores
% 1.87/0.77 # new_bool_3 with pid 31864 completed with status 8
% 1.87/0.77 # new_bool_1 with pid 31865 completed with status 8
% 1.87/0.77 # sh5l with pid 31866 completed with status 0
% 1.87/0.77 # Result found by sh5l
% 1.87/0.77 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.87/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.87/0.77 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.87/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.87/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.87/0.77 # Starting sh5l with 300s (1) cores
% 1.87/0.77 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.87/0.77 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.87/0.77 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.87/0.77 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 1.87/0.77 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 31870 completed with status 0
% 1.87/0.77 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 1.87/0.77 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.87/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.87/0.77 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.87/0.77 # Starting new_bool_3 with 300s (1) cores
% 1.87/0.77 # Starting new_bool_1 with 300s (1) cores
% 1.87/0.77 # Starting sh5l with 300s (1) cores
% 1.87/0.77 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.87/0.77 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.87/0.77 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.87/0.77 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 1.87/0.77 # Preprocessing time : 0.001 s
% 1.87/0.77 # Presaturation interreduction done
% 1.87/0.77
% 1.87/0.77 # Proof found!
% 1.87/0.77 # SZS status Unsatisfiable
% 1.87/0.77 # SZS output start CNFRefutation
% See solution above
% 1.87/0.77 # Parsed axioms : 7
% 1.87/0.77 # Removed by relevancy pruning/SinE : 0
% 1.87/0.77 # Initial clauses : 7
% 1.87/0.77 # Removed in clause preprocessing : 0
% 1.87/0.77 # Initial clauses in saturation : 7
% 1.87/0.77 # Processed clauses : 213
% 1.87/0.77 # ...of these trivial : 49
% 1.87/0.77 # ...subsumed : 0
% 1.87/0.77 # ...remaining for further processing : 164
% 1.87/0.77 # Other redundant clauses eliminated : 0
% 1.87/0.77 # Clauses deleted for lack of memory : 0
% 1.87/0.77 # Backward-subsumed : 0
% 1.87/0.77 # Backward-rewritten : 32
% 1.87/0.77 # Generated clauses : 17793
% 1.87/0.77 # ...of the previous two non-redundant : 16093
% 1.87/0.77 # ...aggressively subsumed : 0
% 1.87/0.77 # Contextual simplify-reflections : 0
% 1.87/0.77 # Paramodulations : 17793
% 1.87/0.77 # Factorizations : 0
% 1.87/0.77 # NegExts : 0
% 1.87/0.77 # Equation resolutions : 0
% 1.87/0.77 # Total rewrite steps : 11590
% 1.87/0.77 # Propositional unsat checks : 0
% 1.87/0.77 # Propositional check models : 0
% 1.87/0.77 # Propositional check unsatisfiable : 0
% 1.87/0.77 # Propositional clauses : 0
% 1.87/0.77 # Propositional clauses after purity: 0
% 1.87/0.77 # Propositional unsat core size : 0
% 1.87/0.77 # Propositional preprocessing time : 0.000
% 1.87/0.77 # Propositional encoding time : 0.000
% 1.87/0.77 # Propositional solver time : 0.000
% 1.87/0.77 # Success case prop preproc time : 0.000
% 1.87/0.77 # Success case prop encoding time : 0.000
% 1.87/0.77 # Success case prop solver time : 0.000
% 1.87/0.77 # Current number of processed clauses : 125
% 1.87/0.77 # Positive orientable unit clauses : 120
% 1.87/0.77 # Positive unorientable unit clauses: 5
% 1.87/0.77 # Negative unit clauses : 0
% 1.87/0.77 # Non-unit-clauses : 0
% 1.87/0.77 # Current number of unprocessed clauses: 15854
% 1.87/0.77 # ...number of literals in the above : 15854
% 1.87/0.77 # Current number of archived formulas : 0
% 1.87/0.77 # Current number of archived clauses : 39
% 1.87/0.77 # Clause-clause subsumption calls (NU) : 0
% 1.87/0.77 # Rec. Clause-clause subsumption calls : 0
% 1.87/0.77 # Non-unit clause-clause subsumptions : 0
% 1.87/0.77 # Unit Clause-clause subsumption calls : 81
% 1.87/0.77 # Rewrite failures with RHS unbound : 0
% 1.87/0.77 # BW rewrite match attempts : 426
% 1.87/0.77 # BW rewrite match successes : 41
% 1.87/0.77 # Condensation attempts : 0
% 1.87/0.77 # Condensation successes : 0
% 1.87/0.77 # Termbank termtop insertions : 284069
% 1.87/0.77
% 1.87/0.77 # -------------------------------------------------
% 1.87/0.77 # User time : 0.266 s
% 1.87/0.77 # System time : 0.016 s
% 1.87/0.77 # Total time : 0.282 s
% 1.87/0.77 # Maximum resident set size: 1420 pages
% 1.87/0.77
% 1.87/0.77 # -------------------------------------------------
% 1.87/0.77 # User time : 0.289 s
% 1.87/0.77 # System time : 0.028 s
% 1.87/0.77 # Total time : 0.317 s
% 1.87/0.77 # Maximum resident set size: 1676 pages
% 1.87/0.77 % E---3.1 exiting
% 1.87/0.77 % E---3.1 exiting
%------------------------------------------------------------------------------