TSTP Solution File: GRP755-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP755-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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:54:22 EDT 2024
% Result : Unsatisfiable 4.44s 0.98s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of clauses : 52 ( 28 unt; 16 nHn; 12 RR)
% Number of literals : 76 ( 75 equ; 11 neg)
% Maximal clause size : 2 ( 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 : 89 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f01) ).
cnf(f09,axiom,
i(X1) = ld(X1,unit),
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f09) ).
cnf(f07,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X3),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f07) ).
cnf(f08,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X3,X2)) = mult(mult(X1,X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f08) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f06) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f02) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',f05) ).
cnf(goals,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
file('/export/starexec/sandbox2/tmp/tmp.xHJGpKykWe/E---3.1_778.p',goals) ).
cnf(c_0_8,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_9,axiom,
i(X1) = ld(X1,unit),
f09 ).
cnf(c_0_10,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X2,X3)) = mult(mult(X1,X3),X2) ),
f07 ).
cnf(c_0_11,axiom,
( mult(X1,mult(X2,X3)) = mult(mult(X1,X2),X3)
| mult(X1,mult(X3,X2)) = mult(mult(X1,X2),X3) ),
f08 ).
cnf(c_0_12,plain,
mult(X1,i(X1)) = unit,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_14,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_15,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_16,plain,
( mult(X1,mult(X2,i(X1))) = X2
| mult(X1,mult(i(X1),X2)) = X2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
( mult(mult(X1,mult(X2,X3)),X2) = mult(mult(X1,X3),mult(X2,X2))
| mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_19,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13]) ).
cnf(c_0_20,plain,
( mult(X1,mult(X2,i(X1))) = X2
| ld(X1,X2) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( mult(mult(X1,i(X2)),mult(X2,X2)) = mult(X1,X2)
| mult(mult(X1,X2),i(X2)) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
( mult(mult(X1,X2),mult(i(X1),i(X1))) = mult(X1,mult(mult(i(X1),i(X1)),X2))
| mult(X1,mult(mult(i(X1),i(X1)),X2)) = mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_23,plain,
( ld(X1,X2) = mult(i(X1),X2)
| ld(X1,X2) = mult(X2,i(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,plain,
( mult(X1,mult(mult(i(X1),i(X1)),i(i(X1)))) = unit
| i(i(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]),c_0_12]),c_0_13]),c_0_12])]) ).
cnf(c_0_25,plain,
( ld(X1,X2) = mult(i(X1),X2)
| mult(X2,i(X1)) != mult(i(X1),X2) ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_26,plain,
( mult(mult(X1,X2),i(X1)) = mult(X1,mult(i(X1),X2))
| mult(X1,mult(i(X1),X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_12]),c_0_13]) ).
cnf(c_0_27,plain,
( mult(mult(i(X1),i(X1)),i(i(X1))) = i(X1)
| i(i(X1)) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_24]),c_0_9]) ).
cnf(c_0_28,plain,
( mult(X1,mult(i(X1),X2)) = X2
| mult(X2,i(X1)) != mult(i(X1),X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_29,plain,
( mult(i(X1),mult(i(i(X1)),i(X1))) = i(X1)
| i(i(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_31,plain,
( i(i(X1)) = X1
| mult(i(i(X1)),i(X1)) != unit ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_12]),c_0_18]) ).
cnf(c_0_32,plain,
( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
| mult(X1,mult(X2,X3)) != mult(X1,mult(X3,X2)) ),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
i(i(X1)) = X1,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( ld(mult(X1,X2),mult(X1,mult(X3,X2))) = X3
| mult(X1,mult(X2,X3)) != mult(X1,mult(X3,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_35,plain,
mult(i(X1),X1) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_33]) ).
cnf(c_0_36,plain,
( ld(X1,X2) = mult(X2,i(X1))
| mult(i(X1),X2) != mult(X2,i(X1)) ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_37,plain,
ld(mult(X1,X2),X1) = i(X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18]),c_0_12]),c_0_18]),c_0_18])]) ).
cnf(c_0_38,plain,
( mult(X1,mult(X2,i(X1))) = X2
| mult(i(X1),X2) != mult(X2,i(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_36]) ).
cnf(c_0_39,plain,
mult(mult(X1,X2),i(X2)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_37]) ).
cnf(c_0_40,plain,
( mult(X1,mult(X2,ld(X1,X3))) = mult(X3,X2)
| mult(X1,mult(ld(X1,X3),X2)) = mult(X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_41,plain,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X2,X1)) != X2 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( mult(i(X1),mult(X1,X2)) = X2
| mult(mult(X1,X2),i(X1)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_15]) ).
cnf(c_0_43,plain,
mult(X1,i(ld(X2,X1))) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_18]),c_0_12]),c_0_18])]) ).
cnf(c_0_44,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_33])]) ).
cnf(c_0_45,plain,
i(ld(X1,X2)) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_46,plain,
ld(X1,X2) = mult(i(X1),X2),
inference(spm,[status(thm)],[c_0_44,c_0_8]) ).
cnf(c_0_47,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_48,plain,
i(mult(i(X1),X2)) = mult(i(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
i(mult(a,b)) != mult(i(b),i(a)),
c_0_47 ).
cnf(c_0_50,plain,
mult(i(X1),i(X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_48,c_0_33]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP755-1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n011.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri May 3 16:01:23 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.xHJGpKykWe/E---3.1_778.p
% 4.44/0.98 # Version: 3.1.0
% 4.44/0.98 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.44/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.44/0.98 # Starting new_bool_3 with 300s (1) cores
% 4.44/0.98 # Starting new_bool_1 with 300s (1) cores
% 4.44/0.98 # Starting sh5l with 300s (1) cores
% 4.44/0.98 # new_bool_3 with pid 857 completed with status 0
% 4.44/0.98 # Result found by new_bool_3
% 4.44/0.98 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.44/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.44/0.98 # Starting new_bool_3 with 300s (1) cores
% 4.44/0.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.44/0.98 # Search class: FGUPM-FFSF21-SFFFFFNN
% 4.44/0.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.44/0.98 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 150s (1) cores
% 4.44/0.98 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 860 completed with status 0
% 4.44/0.98 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 4.44/0.98 # Preprocessing class: FSSSSMSSSSSNFFN.
% 4.44/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.44/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.44/0.98 # Starting new_bool_3 with 300s (1) cores
% 4.44/0.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.44/0.98 # Search class: FGUPM-FFSF21-SFFFFFNN
% 4.44/0.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 4.44/0.98 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 150s (1) cores
% 4.44/0.98 # Preprocessing time : 0.001 s
% 4.44/0.98
% 4.44/0.98 # Proof found!
% 4.44/0.98 # SZS status Unsatisfiable
% 4.44/0.98 # SZS output start CNFRefutation
% See solution above
% 4.44/0.98 # Parsed axioms : 10
% 4.44/0.98 # Removed by relevancy pruning/SinE : 2
% 4.44/0.98 # Initial clauses : 8
% 4.44/0.98 # Removed in clause preprocessing : 0
% 4.44/0.98 # Initial clauses in saturation : 8
% 4.44/0.98 # Processed clauses : 345
% 4.44/0.98 # ...of these trivial : 35
% 4.44/0.98 # ...subsumed : 114
% 4.44/0.98 # ...remaining for further processing : 196
% 4.44/0.98 # Other redundant clauses eliminated : 0
% 4.44/0.98 # Clauses deleted for lack of memory : 0
% 4.44/0.98 # Backward-subsumed : 8
% 4.44/0.98 # Backward-rewritten : 114
% 4.44/0.98 # Generated clauses : 27684
% 4.44/0.98 # ...of the previous two non-redundant : 24662
% 4.44/0.98 # ...aggressively subsumed : 0
% 4.44/0.98 # Contextual simplify-reflections : 3
% 4.44/0.98 # Paramodulations : 27634
% 4.44/0.98 # Factorizations : 40
% 4.44/0.98 # NegExts : 0
% 4.44/0.98 # Equation resolutions : 10
% 4.44/0.98 # Disequality decompositions : 0
% 4.44/0.98 # Total rewrite steps : 19174
% 4.44/0.98 # ...of those cached : 18551
% 4.44/0.98 # Propositional unsat checks : 0
% 4.44/0.98 # Propositional check models : 0
% 4.44/0.98 # Propositional check unsatisfiable : 0
% 4.44/0.98 # Propositional clauses : 0
% 4.44/0.98 # Propositional clauses after purity: 0
% 4.44/0.98 # Propositional unsat core size : 0
% 4.44/0.98 # Propositional preprocessing time : 0.000
% 4.44/0.98 # Propositional encoding time : 0.000
% 4.44/0.98 # Propositional solver time : 0.000
% 4.44/0.98 # Success case prop preproc time : 0.000
% 4.44/0.98 # Success case prop encoding time : 0.000
% 4.44/0.98 # Success case prop solver time : 0.000
% 4.44/0.98 # Current number of processed clauses : 74
% 4.44/0.98 # Positive orientable unit clauses : 21
% 4.44/0.98 # Positive unorientable unit clauses: 0
% 4.44/0.98 # Negative unit clauses : 0
% 4.44/0.98 # Non-unit-clauses : 53
% 4.44/0.98 # Current number of unprocessed clauses: 24277
% 4.44/0.98 # ...number of literals in the above : 80501
% 4.44/0.98 # Current number of archived formulas : 0
% 4.44/0.98 # Current number of archived clauses : 122
% 4.44/0.98 # Clause-clause subsumption calls (NU) : 2696
% 4.44/0.98 # Rec. Clause-clause subsumption calls : 2381
% 4.44/0.98 # Non-unit clause-clause subsumptions : 119
% 4.44/0.98 # Unit Clause-clause subsumption calls : 360
% 4.44/0.98 # Rewrite failures with RHS unbound : 0
% 4.44/0.98 # BW rewrite match attempts : 150
% 4.44/0.98 # BW rewrite match successes : 55
% 4.44/0.98 # Condensation attempts : 0
% 4.44/0.98 # Condensation successes : 0
% 4.44/0.98 # Termbank termtop insertions : 703929
% 4.44/0.98 # Search garbage collected termcells : 7
% 4.44/0.98
% 4.44/0.98 # -------------------------------------------------
% 4.44/0.98 # User time : 0.517 s
% 4.44/0.98 # System time : 0.017 s
% 4.44/0.98 # Total time : 0.534 s
% 4.44/0.98 # Maximum resident set size: 1636 pages
% 4.44/0.98
% 4.44/0.98 # -------------------------------------------------
% 4.44/0.98 # User time : 0.517 s
% 4.44/0.98 # System time : 0.020 s
% 4.44/0.98 # Total time : 0.536 s
% 4.44/0.98 # Maximum resident set size: 1688 pages
% 4.44/0.98 % E---3.1 exiting
% 4.44/0.98 % E exiting
%------------------------------------------------------------------------------