TSTP Solution File: GRP756-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP756-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 3 RR)
% Number of literals : 30 ( 29 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 : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f05,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.KJaoc4zRPp/E---3.1_24268.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.KJaoc4zRPp/E---3.1_24268.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.KJaoc4zRPp/E---3.1_24268.p',f02) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.KJaoc4zRPp/E---3.1_24268.p',f04) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.KJaoc4zRPp/E---3.1_24268.p',f01) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
file('/export/starexec/sandbox2/tmp/tmp.KJaoc4zRPp/E---3.1_24268.p',goals) ).
cnf(c_0_6,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
f05 ).
cnf(c_0_7,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_8,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_9,plain,
mult(rd(X1,X2),mult(mult(X2,X2),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_11,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_12,plain,
ld(rd(X1,X2),mult(X1,mult(X2,X3))) = mult(mult(X2,X2),X3),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
mult(X1,mult(mult(X2,X2),ld(X2,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,plain,
mult(mult(ld(X1,X2),ld(X1,X2)),X3) = ld(X1,mult(X2,mult(ld(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
mult(mult(X1,ld(X2,X3)),X4) = mult(X1,ld(X2,mult(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]) ).
cnf(c_0_17,plain,
rd(mult(X1,ld(X2,mult(X3,X4))),X4) = mult(X1,ld(X2,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,plain,
ld(mult(X1,X2),mult(X1,mult(mult(X2,X2),X3))) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_19,plain,
rd(mult(X1,mult(X2,X3)),mult(mult(X2,X2),X3)) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_20,plain,
mult(X1,mult(X2,ld(mult(X2,X2),X3))) = mult(rd(X1,X2),X3),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_21,plain,
mult(X1,ld(mult(X2,X3),X2)) = rd(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_7]) ).
cnf(c_0_23,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_24,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_25,plain,
rd(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_26,plain,
ld(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
goals ).
cnf(c_0_28,plain,
mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : GRP756-1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:57:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.KJaoc4zRPp/E---3.1_24268.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24346 completed with status 0
% 0.19/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.19/0.50 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.50 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.19/0.50 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 24355 completed with status 0
% 0.19/0.50 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.19/0.50 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.50 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Unsatisfiable
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 6
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 6
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 6
% 0.19/0.50 # Processed clauses : 85
% 0.19/0.50 # ...of these trivial : 21
% 0.19/0.50 # ...subsumed : 17
% 0.19/0.50 # ...remaining for further processing : 47
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 1
% 0.19/0.50 # Backward-rewritten : 18
% 0.19/0.50 # Generated clauses : 878
% 0.19/0.50 # ...of the previous two non-redundant : 645
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 878
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 846
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 22
% 0.19/0.50 # Positive orientable unit clauses : 20
% 0.19/0.50 # Positive unorientable unit clauses: 2
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 0
% 0.19/0.50 # Current number of unprocessed clauses: 561
% 0.19/0.50 # ...number of literals in the above : 561
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 25
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 18
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 149
% 0.19/0.50 # BW rewrite match successes : 24
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 8963
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.010 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1508 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.049 s
% 0.19/0.50 # System time : 0.012 s
% 0.19/0.50 # Total time : 0.060 s
% 0.19/0.50 # Maximum resident set size: 1668 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------