TSTP Solution File: GRP751-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP751-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:21 EDT 2024
% Result : Unsatisfiable 1.14s 0.62s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 4 RR)
% Number of literals : 28 ( 27 equ; 3 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f07,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.C43BB1HgxP/E---3.1_11873.p',f07) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.C43BB1HgxP/E---3.1_11873.p',f03) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.C43BB1HgxP/E---3.1_11873.p',f04) ).
cnf(f05,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
file('/export/starexec/sandbox/tmp/tmp.C43BB1HgxP/E---3.1_11873.p',f05) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
file('/export/starexec/sandbox/tmp/tmp.C43BB1HgxP/E---3.1_11873.p',goals) ).
cnf(c_0_5,axiom,
mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
f07 ).
cnf(c_0_6,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_7,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_8,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X2)) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
rd(mult(X1,mult(X2,X3)),mult(X3,X3)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
rd(mult(X1,X2),mult(X3,X3)) = mult(rd(X1,X3),rd(X2,X3)),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
mult(rd(rd(X1,X2),X3),rd(X2,X3)) = rd(X1,mult(X3,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_12,plain,
mult(mult(rd(X1,X2),X3),mult(X2,X3)) = mult(X1,mult(X3,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,plain,
rd(rd(X1,mult(X2,X2)),rd(X3,X2)) = rd(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,axiom,
mult(mult(X1,mult(X1,X1)),mult(X2,X3)) = mult(mult(X1,X2),mult(mult(X1,X1),X3)),
f05 ).
cnf(c_0_15,plain,
rd(mult(X1,mult(X2,X2)),mult(X3,X2)) = mult(rd(X1,X3),X2),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
rd(rd(X1,mult(X2,X2)),X3) = rd(rd(X1,mult(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_17,plain,
rd(mult(mult(X1,mult(X1,X1)),mult(X2,X3)),mult(mult(X1,X1),X3)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
rd(mult(X1,mult(X2,X2)),X3) = mult(rd(X1,rd(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_19,plain,
mult(rd(X1,rd(X2,X1)),rd(X3,X1)) = rd(mult(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]),c_0_18]),c_0_10]),c_0_7]) ).
cnf(c_0_20,plain,
mult(rd(mult(rd(X1,X2),X3),rd(X4,X2)),X2) = rd(mult(X1,mult(X3,X2)),X4),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_21,plain,
rd(mult(X1,mult(X2,X1)),X3) = mult(rd(X1,rd(X3,X1)),X2),
inference(spm,[status(thm)],[c_0_19,c_0_7]) ).
cnf(c_0_22,plain,
rd(mult(X1,mult(X2,X3)),mult(X4,X3)) = mult(rd(mult(rd(X1,X3),X2),X4),X3),
inference(spm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_23,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_24,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_21,c_0_22]),c_0_7]) ).
cnf(c_0_25,negated_conjecture,
mult(a,mult(b,c)) != mult(mult(rd(a,a),b),mult(a,c)),
c_0_23 ).
cnf(c_0_26,plain,
mult(mult(rd(X1,X1),X2),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_24]),c_0_8]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP751-1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.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 : Fri May 3 15:57:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/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.C43BB1HgxP/E---3.1_11873.p
% 1.14/0.62 # Version: 3.1.0
% 1.14/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.14/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.14/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.14/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.14/0.62 # Starting sh5l with 300s (1) cores
% 1.14/0.62 # new_bool_3 with pid 11953 completed with status 0
% 1.14/0.62 # Result found by new_bool_3
% 1.14/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.14/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.14/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.14/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.14/0.62 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.14/0.62 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.14/0.62 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 1.14/0.62 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 11958 completed with status 0
% 1.14/0.62 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 1.14/0.62 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.14/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.62 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.14/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.14/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.14/0.62 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.14/0.62 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.14/0.62 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 1.14/0.62 # Preprocessing time : 0.001 s
% 1.14/0.62 # Presaturation interreduction done
% 1.14/0.62
% 1.14/0.62 # Proof found!
% 1.14/0.62 # SZS status Unsatisfiable
% 1.14/0.62 # SZS output start CNFRefutation
% See solution above
% 1.14/0.62 # Parsed axioms : 8
% 1.14/0.62 # Removed by relevancy pruning/SinE : 2
% 1.14/0.62 # Initial clauses : 6
% 1.14/0.62 # Removed in clause preprocessing : 0
% 1.14/0.62 # Initial clauses in saturation : 6
% 1.14/0.62 # Processed clauses : 154
% 1.14/0.62 # ...of these trivial : 9
% 1.14/0.62 # ...subsumed : 69
% 1.14/0.62 # ...remaining for further processing : 76
% 1.14/0.62 # Other redundant clauses eliminated : 0
% 1.14/0.62 # Clauses deleted for lack of memory : 0
% 1.14/0.62 # Backward-subsumed : 0
% 1.14/0.62 # Backward-rewritten : 9
% 1.14/0.62 # Generated clauses : 11696
% 1.14/0.62 # ...of the previous two non-redundant : 10896
% 1.14/0.62 # ...aggressively subsumed : 0
% 1.14/0.62 # Contextual simplify-reflections : 0
% 1.14/0.62 # Paramodulations : 11696
% 1.14/0.62 # Factorizations : 0
% 1.14/0.62 # NegExts : 0
% 1.14/0.62 # Equation resolutions : 0
% 1.14/0.62 # Disequality decompositions : 0
% 1.14/0.62 # Total rewrite steps : 4603
% 1.14/0.62 # ...of those cached : 2916
% 1.14/0.62 # Propositional unsat checks : 0
% 1.14/0.62 # Propositional check models : 0
% 1.14/0.62 # Propositional check unsatisfiable : 0
% 1.14/0.62 # Propositional clauses : 0
% 1.14/0.62 # Propositional clauses after purity: 0
% 1.14/0.62 # Propositional unsat core size : 0
% 1.14/0.62 # Propositional preprocessing time : 0.000
% 1.14/0.62 # Propositional encoding time : 0.000
% 1.14/0.62 # Propositional solver time : 0.000
% 1.14/0.62 # Success case prop preproc time : 0.000
% 1.14/0.62 # Success case prop encoding time : 0.000
% 1.14/0.62 # Success case prop solver time : 0.000
% 1.14/0.62 # Current number of processed clauses : 61
% 1.14/0.62 # Positive orientable unit clauses : 41
% 1.14/0.62 # Positive unorientable unit clauses: 20
% 1.14/0.62 # Negative unit clauses : 0
% 1.14/0.62 # Non-unit-clauses : 0
% 1.14/0.62 # Current number of unprocessed clauses: 10738
% 1.14/0.62 # ...number of literals in the above : 10738
% 1.14/0.62 # Current number of archived formulas : 0
% 1.14/0.62 # Current number of archived clauses : 15
% 1.14/0.62 # Clause-clause subsumption calls (NU) : 0
% 1.14/0.62 # Rec. Clause-clause subsumption calls : 0
% 1.14/0.62 # Non-unit clause-clause subsumptions : 0
% 1.14/0.62 # Unit Clause-clause subsumption calls : 73
% 1.14/0.62 # Rewrite failures with RHS unbound : 0
% 1.14/0.62 # BW rewrite match attempts : 210
% 1.14/0.62 # BW rewrite match successes : 13
% 1.14/0.62 # Condensation attempts : 0
% 1.14/0.62 # Condensation successes : 0
% 1.14/0.62 # Termbank termtop insertions : 220731
% 1.14/0.62 # Search garbage collected termcells : 7
% 1.14/0.62
% 1.14/0.62 # -------------------------------------------------
% 1.14/0.62 # User time : 0.127 s
% 1.14/0.62 # System time : 0.015 s
% 1.14/0.62 # Total time : 0.141 s
% 1.14/0.62 # Maximum resident set size: 1624 pages
% 1.14/0.62
% 1.14/0.62 # -------------------------------------------------
% 1.14/0.62 # User time : 0.128 s
% 1.14/0.62 # System time : 0.017 s
% 1.14/0.62 # Total time : 0.144 s
% 1.14/0.62 # Maximum resident set size: 1688 pages
% 1.14/0.62 % E---3.1 exiting
% 1.14/0.63 % E exiting
%------------------------------------------------------------------------------