TSTP Solution File: GRP687-1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : GRP687-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 Jun 24 06:48:25 EDT 2024
% Result : Unsatisfiable 0.21s 0.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 4 RR)
% Number of literals : 35 ( 34 equ; 3 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',c05) ).
cnf(c07,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',c07) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',c04) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',c03) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',c02) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',c01) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
file('/export/starexec/sandbox/tmp/tmp.7wGzCtJUmg/E---3.1_13370.p',goals) ).
cnf(c_0_7,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_8,axiom,
mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
c07 ).
cnf(c_0_9,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).
cnf(c_0_10,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_11,plain,
mult(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(X1,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
rd(mult(X1,mult(X1,mult(X2,X3))),X3) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_14,plain,
rd(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(X1,rd(X2,X3))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_16,plain,
mult(X1,mult(X1,rd(X2,mult(X1,X2)))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_17,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_18,plain,
mult(X1,rd(X2,mult(X1,X2))) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
mult(X1,rd(unit,X1)) = unit,
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_20,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_21,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_22,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
mult(X1,mult(X1,ld(X2,unit))) = rd(mult(X1,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_7]),c_0_20]) ).
cnf(c_0_24,plain,
ld(ld(X1,unit),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
mult(rd(X1,X2),mult(rd(X1,X2),mult(X2,X3))) = mult(mult(rd(X1,X2),X1),X3),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_26,plain,
rd(mult(X1,X1),ld(X2,unit)) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_7]) ).
cnf(c_0_27,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_24]),c_0_7]) ).
cnf(c_0_28,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_29,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_30,plain,
ld(mult(X1,mult(X1,X2)),mult(X1,mult(X1,mult(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_31,plain,
mult(X1,mult(X1,mult(mult(X2,mult(X1,X1)),X3))) = mult(X1,mult(X1,mult(X2,mult(X1,mult(X1,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(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_11]),c_0_28]),c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_32,negated_conjecture,
mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
c_0_29 ).
cnf(c_0_33,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP687-1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Jun 20 08:29:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.7wGzCtJUmg/E---3.1_13370.p
% 0.21/0.55 # Version: 3.2.0
% 0.21/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.55 # Starting sh5l with 300s (1) cores
% 0.21/0.55 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 13468 completed with status 0
% 0.21/0.55 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.55 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.55 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.55 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.55 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.21/0.55 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 13478 completed with status 0
% 0.21/0.55 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.21/0.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.55 # No SInE strategy applied
% 0.21/0.55 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.21/0.55 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.55 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.21/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/0.55 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.55 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.55 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.21/0.55 # Preprocessing time : 0.001 s
% 0.21/0.55
% 0.21/0.55 # Proof found!
% 0.21/0.55 # SZS status Unsatisfiable
% 0.21/0.55 # SZS output start CNFRefutation
% See solution above
% 0.21/0.55 # Parsed axioms : 8
% 0.21/0.55 # Removed by relevancy pruning/SinE : 0
% 0.21/0.55 # Initial clauses : 8
% 0.21/0.55 # Removed in clause preprocessing : 0
% 0.21/0.55 # Initial clauses in saturation : 8
% 0.21/0.55 # Processed clauses : 120
% 0.21/0.55 # ...of these trivial : 41
% 0.21/0.55 # ...subsumed : 0
% 0.21/0.55 # ...remaining for further processing : 79
% 0.21/0.55 # Other redundant clauses eliminated : 0
% 0.21/0.55 # Clauses deleted for lack of memory : 0
% 0.21/0.55 # Backward-subsumed : 0
% 0.21/0.55 # Backward-rewritten : 25
% 0.21/0.55 # Generated clauses : 2173
% 0.21/0.55 # ...of the previous two non-redundant : 1384
% 0.21/0.55 # ...aggressively subsumed : 0
% 0.21/0.55 # Contextual simplify-reflections : 0
% 0.21/0.55 # Paramodulations : 2173
% 0.21/0.55 # Factorizations : 0
% 0.21/0.55 # NegExts : 0
% 0.21/0.55 # Equation resolutions : 0
% 0.21/0.55 # Disequality decompositions : 0
% 0.21/0.55 # Total rewrite steps : 4855
% 0.21/0.55 # ...of those cached : 3770
% 0.21/0.55 # Propositional unsat checks : 0
% 0.21/0.55 # Propositional check models : 0
% 0.21/0.55 # Propositional check unsatisfiable : 0
% 0.21/0.55 # Propositional clauses : 0
% 0.21/0.55 # Propositional clauses after purity: 0
% 0.21/0.55 # Propositional unsat core size : 0
% 0.21/0.55 # Propositional preprocessing time : 0.000
% 0.21/0.55 # Propositional encoding time : 0.000
% 0.21/0.55 # Propositional solver time : 0.000
% 0.21/0.55 # Success case prop preproc time : 0.000
% 0.21/0.55 # Success case prop encoding time : 0.000
% 0.21/0.55 # Success case prop solver time : 0.000
% 0.21/0.55 # Current number of processed clauses : 54
% 0.21/0.55 # Positive orientable unit clauses : 54
% 0.21/0.55 # Positive unorientable unit clauses: 0
% 0.21/0.55 # Negative unit clauses : 0
% 0.21/0.55 # Non-unit-clauses : 0
% 0.21/0.55 # Current number of unprocessed clauses: 1221
% 0.21/0.55 # ...number of literals in the above : 1221
% 0.21/0.55 # Current number of archived formulas : 0
% 0.21/0.55 # Current number of archived clauses : 25
% 0.21/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.55 # Non-unit clause-clause subsumptions : 0
% 0.21/0.55 # Unit Clause-clause subsumption calls : 0
% 0.21/0.55 # Rewrite failures with RHS unbound : 0
% 0.21/0.55 # BW rewrite match attempts : 94
% 0.21/0.55 # BW rewrite match successes : 24
% 0.21/0.55 # Condensation attempts : 0
% 0.21/0.55 # Condensation successes : 0
% 0.21/0.55 # Termbank termtop insertions : 35978
% 0.21/0.55 # Search garbage collected termcells : 2
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.032 s
% 0.21/0.55 # System time : 0.004 s
% 0.21/0.55 # Total time : 0.036 s
% 0.21/0.55 # Maximum resident set size: 1552 pages
% 0.21/0.55
% 0.21/0.55 # -------------------------------------------------
% 0.21/0.55 # User time : 0.148 s
% 0.21/0.55 # System time : 0.019 s
% 0.21/0.55 # Total time : 0.167 s
% 0.21/0.55 # Maximum resident set size: 1684 pages
% 0.21/0.55 % E---3.1 exiting
% 0.21/0.55 % E exiting
%------------------------------------------------------------------------------