TSTP Solution File: GRP669-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP669-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 08:01:40 EDT 2024
% Result : Unsatisfiable 1.64s 0.73s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 6 RR)
% Number of literals : 26 ( 25 equ; 5 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c10,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',c10) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',c06) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',c05) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',c07) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',goals) ).
cnf(c08,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',c08) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p',c03) ).
cnf(c_0_7,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
c10 ).
cnf(c_0_8,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_9,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_10,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
c07 ).
cnf(c_0_11,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_14,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_8]) ).
cnf(c_0_15,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
c08 ).
cnf(c_0_16,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
c_0_13 ).
cnf(c_0_17,plain,
mult(mult(X1,X2),mult(X3,mult(X3,X1))) = mult(X1,mult(mult(X2,mult(X3,X3)),X1)),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_18,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_8]) ).
cnf(c_0_19,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_20,negated_conjecture,
mult(mult(a,mult(mult(b,c),a)),b) != mult(mult(a,b),mult(c,mult(a,b))),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_21,plain,
mult(mult(X1,X2),mult(mult(X3,X1),mult(X1,X2))) = mult(X1,mult(X2,mult(mult(X3,mult(X1,X1)),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_7]),c_0_12]),c_0_17]) ).
cnf(c_0_22,plain,
mult(rd(X1,X2),mult(X2,X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(a,mult(b,mult(mult(c,a),b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_12]),c_0_7]) ).
cnf(c_0_24,plain,
mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(X1,mult(X2,mult(mult(X3,X1),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP669-1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 16:22:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.g2WwJlGBjK/E---3.1_28835.p
% 1.64/0.73 # Version: 3.1.0
% 1.64/0.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.64/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.64/0.73 # Starting new_bool_3 with 300s (1) cores
% 1.64/0.73 # Starting new_bool_1 with 300s (1) cores
% 1.64/0.73 # Starting sh5l with 300s (1) cores
% 1.64/0.73 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28955 completed with status 0
% 1.64/0.73 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.64/0.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.64/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.64/0.73 # No SInE strategy applied
% 1.64/0.73 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.64/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.64/0.73 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 1.64/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.64/0.73 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.73 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.73 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.64/0.73 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 28966 completed with status 0
% 1.64/0.73 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 1.64/0.73 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.64/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.64/0.73 # No SInE strategy applied
% 1.64/0.73 # Search class: FUUPM-FFSF22-MFFFFFNN
% 1.64/0.73 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.64/0.73 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 1.64/0.73 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.64/0.73 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.73 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.64/0.73 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 1.64/0.73 # Preprocessing time : 0.001 s
% 1.64/0.73
% 1.64/0.73 # Proof found!
% 1.64/0.73 # SZS status Unsatisfiable
% 1.64/0.73 # SZS output start CNFRefutation
% See solution above
% 1.64/0.73 # Parsed axioms : 11
% 1.64/0.73 # Removed by relevancy pruning/SinE : 0
% 1.64/0.73 # Initial clauses : 11
% 1.64/0.73 # Removed in clause preprocessing : 0
% 1.64/0.73 # Initial clauses in saturation : 11
% 1.64/0.73 # Processed clauses : 374
% 1.64/0.73 # ...of these trivial : 184
% 1.64/0.73 # ...subsumed : 0
% 1.64/0.73 # ...remaining for further processing : 190
% 1.64/0.73 # Other redundant clauses eliminated : 0
% 1.64/0.73 # Clauses deleted for lack of memory : 0
% 1.64/0.73 # Backward-subsumed : 0
% 1.64/0.73 # Backward-rewritten : 71
% 1.64/0.73 # Generated clauses : 14888
% 1.64/0.73 # ...of the previous two non-redundant : 11190
% 1.64/0.73 # ...aggressively subsumed : 0
% 1.64/0.73 # Contextual simplify-reflections : 0
% 1.64/0.73 # Paramodulations : 14888
% 1.64/0.73 # Factorizations : 0
% 1.64/0.73 # NegExts : 0
% 1.64/0.73 # Equation resolutions : 0
% 1.64/0.73 # Disequality decompositions : 0
% 1.64/0.73 # Total rewrite steps : 31607
% 1.64/0.73 # ...of those cached : 25672
% 1.64/0.73 # Propositional unsat checks : 0
% 1.64/0.73 # Propositional check models : 0
% 1.64/0.73 # Propositional check unsatisfiable : 0
% 1.64/0.73 # Propositional clauses : 0
% 1.64/0.73 # Propositional clauses after purity: 0
% 1.64/0.73 # Propositional unsat core size : 0
% 1.64/0.73 # Propositional preprocessing time : 0.000
% 1.64/0.73 # Propositional encoding time : 0.000
% 1.64/0.73 # Propositional solver time : 0.000
% 1.64/0.73 # Success case prop preproc time : 0.000
% 1.64/0.73 # Success case prop encoding time : 0.000
% 1.64/0.73 # Success case prop solver time : 0.000
% 1.64/0.73 # Current number of processed clauses : 119
% 1.64/0.73 # Positive orientable unit clauses : 119
% 1.64/0.73 # Positive unorientable unit clauses: 0
% 1.64/0.73 # Negative unit clauses : 0
% 1.64/0.73 # Non-unit-clauses : 0
% 1.64/0.73 # Current number of unprocessed clauses: 10581
% 1.64/0.73 # ...number of literals in the above : 10581
% 1.64/0.73 # Current number of archived formulas : 0
% 1.64/0.73 # Current number of archived clauses : 71
% 1.64/0.73 # Clause-clause subsumption calls (NU) : 0
% 1.64/0.73 # Rec. Clause-clause subsumption calls : 0
% 1.64/0.73 # Non-unit clause-clause subsumptions : 0
% 1.64/0.73 # Unit Clause-clause subsumption calls : 0
% 1.64/0.73 # Rewrite failures with RHS unbound : 0
% 1.64/0.73 # BW rewrite match attempts : 435
% 1.64/0.73 # BW rewrite match successes : 68
% 1.64/0.73 # Condensation attempts : 0
% 1.64/0.73 # Condensation successes : 0
% 1.64/0.73 # Termbank termtop insertions : 220568
% 1.64/0.73 # Search garbage collected termcells : 2
% 1.64/0.73
% 1.64/0.73 # -------------------------------------------------
% 1.64/0.73 # User time : 0.175 s
% 1.64/0.73 # System time : 0.018 s
% 1.64/0.73 # Total time : 0.193 s
% 1.64/0.73 # Maximum resident set size: 1556 pages
% 1.64/0.73
% 1.64/0.73 # -------------------------------------------------
% 1.64/0.73 # User time : 0.883 s
% 1.64/0.73 # System time : 0.061 s
% 1.64/0.73 # Total time : 0.944 s
% 1.64/0.73 # Maximum resident set size: 1688 pages
% 1.64/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------