TSTP Solution File: GRP682-11 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP682-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:49 EDT 2023
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% 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 : 5 ( 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 : 108 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f02,axiom,
rd(mult(X1,X1),X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f02) ).
cnf(f04,axiom,
mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f04) ).
cnf(f07,axiom,
ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f07) ).
cnf(f03,axiom,
mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f03) ).
cnf(f01,axiom,
ld(X1,mult(X1,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f01) ).
cnf(f05,axiom,
ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f05) ).
cnf(f06,axiom,
rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,rd(mult(X2,X4),X4)),
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',f06) ).
cnf(goal,negated_conjecture,
ld(rd(x0,x1),mult(rd(x0,x1),x2)) != ld(x0,mult(x0,x2)),
file('/export/starexec/sandbox2/tmp/tmp.hV6dzqv53D/E---3.1_29690.p',goal) ).
cnf(c_0_8,axiom,
rd(mult(X1,X1),X1) = X1,
f02 ).
cnf(c_0_9,axiom,
mult(rd(X1,X2),X2) = rd(mult(X1,X2),X2),
f04 ).
cnf(c_0_10,plain,
mult(rd(X1,X1),X1) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
ld(X1,mult(X1,ld(X2,X2))) = rd(mult(rd(X1,X1),X2),X2),
f07 ).
cnf(c_0_12,plain,
mult(rd(rd(X1,X1),X1),X1) = rd(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
mult(rd(rd(X1,X1),X2),X2) = ld(X1,mult(X1,ld(X2,X2))),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_14,axiom,
mult(X1,ld(X1,X2)) = ld(X1,mult(X1,X2)),
f03 ).
cnf(c_0_15,axiom,
ld(X1,mult(X1,X1)) = X1,
f01 ).
cnf(c_0_16,axiom,
ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = mult(ld(X1,mult(X1,X3)),X4),
f05 ).
cnf(c_0_17,plain,
rd(X1,X1) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
mult(ld(X1,mult(X1,X2)),X3) = ld(X1,mult(X1,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
mult(rd(ld(X1,X1),X2),X2) = ld(X1,mult(X1,ld(X2,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_20,plain,
mult(ld(X1,X1),X1) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,axiom,
rd(mult(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,rd(mult(X2,X4),X4)),
f06 ).
cnf(c_0_22,plain,
ld(X1,mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_23,plain,
ld(ld(X1,X2),mult(ld(X1,X2),mult(X3,X4))) = ld(X1,mult(X1,mult(X3,X4))),
inference(rw,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_24,plain,
ld(X1,mult(X1,ld(ld(X1,X1),ld(X1,X1)))) = ld(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20]) ).
cnf(c_0_25,plain,
mult(rd(mult(X1,X2),rd(X3,X4)),rd(X3,X4)) = mult(X1,mult(rd(X2,X4),X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_9]),c_0_9]) ).
cnf(c_0_26,plain,
ld(X1,mult(X1,mult(ld(X1,X2),X3))) = mult(ld(X1,X2),X3),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
mult(X1,ld(ld(X1,X1),ld(X1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_14]),c_0_15]),c_0_22]) ).
cnf(c_0_28,plain,
mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(ld(X1,X1),mult(rd(X1,X3),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,plain,
rd(ld(X1,mult(X1,X2)),ld(X1,X2)) = mult(rd(X1,ld(X1,X2)),ld(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_30,plain,
ld(ld(X1,X2),mult(ld(X1,X2),X3)) = ld(X1,mult(X1,X3)),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_31,plain,
ld(X1,ld(X1,mult(X1,X2))) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14]) ).
cnf(c_0_32,plain,
mult(rd(X1,rd(X2,X1)),rd(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_20]),c_0_20]) ).
cnf(c_0_33,plain,
mult(rd(X1,ld(X1,X1)),ld(X1,X1)) = rd(X1,ld(X1,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_34,plain,
ld(mult(X1,X2),mult(mult(X1,X2),X3)) = ld(X1,mult(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_35,plain,
ld(ld(X1,X2),ld(X1,mult(X1,X3))) = ld(ld(X1,X2),X3),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_36,plain,
mult(rd(X1,rd(X2,rd(X3,X1))),rd(X2,rd(X3,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_20]) ).
cnf(c_0_37,plain,
rd(X1,ld(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_17]),c_0_33]) ).
cnf(c_0_38,plain,
ld(ld(X1,mult(X1,X2)),mult(X2,X3)) = ld(X1,mult(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_34]),c_0_18]),c_0_35]),c_0_34]) ).
cnf(c_0_39,plain,
mult(ld(X1,X2),ld(X1,mult(X1,X3))) = mult(ld(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_22]) ).
cnf(c_0_40,plain,
ld(X1,mult(X1,ld(rd(X2,X1),rd(X2,X1)))) = ld(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_19]) ).
cnf(c_0_41,plain,
ld(X1,mult(X1,ld(X2,mult(X2,X3)))) = ld(X1,mult(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_38]) ).
cnf(c_0_42,plain,
mult(X1,ld(rd(X2,X1),rd(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_40]),c_0_14]),c_0_15]),c_0_22]) ).
cnf(c_0_43,plain,
mult(X1,ld(X2,mult(X2,X3))) = mult(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_41]),c_0_14]),c_0_22]),c_0_22]) ).
cnf(c_0_44,plain,
ld(ld(X1,mult(X1,ld(X2,X2))),X2) = ld(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_38,c_0_20]) ).
cnf(c_0_45,plain,
mult(rd(X1,rd(X2,X3)),rd(X2,X3)) = mult(X1,ld(X3,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_42]),c_0_19]),c_0_43]) ).
cnf(c_0_46,plain,
ld(ld(X1,X1),ld(X1,X1)) = ld(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_27]),c_0_14]),c_0_15]) ).
cnf(c_0_47,plain,
mult(rd(X1,X2),X2) = mult(X1,ld(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_37]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
ld(rd(x0,x1),mult(rd(x0,x1),x2)) != ld(x0,mult(x0,x2)),
goal ).
cnf(c_0_49,plain,
ld(rd(X1,X2),mult(rd(X1,X2),X3)) = ld(X1,mult(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_47]),c_0_34]) ).
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.10/0.13 % Problem : GRP682-11 : TPTP v8.1.2. Released v8.1.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 02:48:34 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.hV6dzqv53D/E---3.1_29690.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29768 completed with status 0
% 0.22/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.22/0.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.54 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.54 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.54 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.22/0.54 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 29778 completed with status 0
% 0.22/0.54 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.22/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.54 # No SInE strategy applied
% 0.22/0.54 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.22/0.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.54 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.22/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.54 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.54 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/0.54 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 8
% 0.22/0.54 # Removed by relevancy pruning/SinE : 0
% 0.22/0.54 # Initial clauses : 8
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 8
% 0.22/0.54 # Processed clauses : 177
% 0.22/0.54 # ...of these trivial : 69
% 0.22/0.54 # ...subsumed : 0
% 0.22/0.54 # ...remaining for further processing : 108
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 0
% 0.22/0.54 # Backward-rewritten : 63
% 0.22/0.54 # Generated clauses : 3374
% 0.22/0.54 # ...of the previous two non-redundant : 2096
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 3374
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Total rewrite steps : 5486
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 45
% 0.22/0.54 # Positive orientable unit clauses : 45
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 0
% 0.22/0.54 # Non-unit-clauses : 0
% 0.22/0.54 # Current number of unprocessed clauses: 1862
% 0.22/0.54 # ...number of literals in the above : 1862
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 63
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.54 # Non-unit clause-clause subsumptions : 0
% 0.22/0.54 # Unit Clause-clause subsumption calls : 0
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 161
% 0.22/0.54 # BW rewrite match successes : 63
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 42633
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.033 s
% 0.22/0.54 # System time : 0.006 s
% 0.22/0.54 # Total time : 0.039 s
% 0.22/0.54 # Maximum resident set size: 1516 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.176 s
% 0.22/0.54 # System time : 0.021 s
% 0.22/0.54 # Total time : 0.197 s
% 0.22/0.54 # Maximum resident set size: 1672 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------