TSTP Solution File: RNG025-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG025-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 09:14:52 EDT 2024
% Result : Unsatisfiable 5.64s 1.18s
% Output : CNFRefutation 5.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 7 RR)
% Number of literals : 48 ( 47 equ; 5 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 86 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',additive_inverse_additive_inverse) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',commutativity_for_addition) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',distribute1) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',distribute2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',right_alternative) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',right_multiplicative_zero) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',right_additive_identity) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',left_alternative) ).
cnf(prove_flexible_law,negated_conjecture,
associator(x,y,x) != additive_identity,
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',prove_flexible_law) ).
cnf(associator,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
file('/export/starexec/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p',associator) ).
cnf(c_0_13,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_14,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_15,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_16,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_18,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_20,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_20]),c_0_19]) ).
cnf(c_0_22,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_23,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_24,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_25,plain,
add(multiply(X1,X2),additive_inverse(multiply(X1,add(X2,X3)))) = additive_inverse(multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_27,plain,
additive_inverse(additive_identity) = additive_identity,
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_28,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_29,plain,
add(multiply(X1,X2),multiply(X3,multiply(X2,X2))) = multiply(add(X1,multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
left_alternative ).
cnf(c_0_31,plain,
additive_inverse(multiply(X1,additive_inverse(X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_32,plain,
add(multiply(X1,multiply(X1,X2)),multiply(X3,multiply(X2,X2))) = multiply(add(multiply(X1,X1),multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
associator(x,y,x) != additive_identity,
inference(fof_simplification,[status(thm)],[prove_flexible_law]) ).
cnf(c_0_34,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_35,plain,
multiply(multiply(X1,add(X1,X2)),X2) = multiply(X1,multiply(add(X1,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_22]),c_0_23]) ).
cnf(c_0_36,plain,
add(X1,add(X2,X3)) = add(X2,add(X3,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_37,negated_conjecture,
associator(x,y,x) != additive_identity,
c_0_33 ).
cnf(c_0_38,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_39,plain,
add(multiply(multiply(X1,X2),X3),multiply(X1,multiply(X2,X2))) = multiply(multiply(X1,X2),add(X3,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_24]) ).
cnf(c_0_40,plain,
multiply(multiply(X1,add(X1,X2)),additive_inverse(X2)) = multiply(X1,multiply(add(X1,X2),additive_inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_34]),c_0_34]) ).
cnf(c_0_41,plain,
add(X1,add(X2,X3)) = add(X3,add(X2,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_42,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
add(multiply(multiply(x,y),x),additive_inverse(multiply(x,multiply(y,x)))) != additive_identity,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
multiply(multiply(X1,add(X1,X2)),X1) = multiply(X1,multiply(add(X1,X2),X1)),
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_39,c_0_40]),c_0_22]),c_0_22]),c_0_41]),c_0_42]),c_0_41]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
add(multiply(multiply(x,y),x),multiply(x,multiply(y,additive_inverse(x)))) != additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_34]),c_0_34]) ).
cnf(c_0_46,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_44,c_0_16]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_22]),c_0_22]),c_0_14]),c_0_26]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG025-6 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.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 11:25:46 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.1tG8o3jSpj/E---3.1_26590.p
% 5.64/1.18 # Version: 3.1.0
% 5.64/1.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.64/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.64/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.64/1.18 # Starting new_bool_3 with 300s (1) cores
% 5.64/1.18 # Starting new_bool_1 with 300s (1) cores
% 5.64/1.18 # Starting sh5l with 300s (1) cores
% 5.64/1.18 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26674 completed with status 0
% 5.64/1.18 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.64/1.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.64/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.64/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.64/1.18 # No SInE strategy applied
% 5.64/1.18 # Search class: FUUPM-FFSF21-MFFFFFNN
% 5.64/1.18 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.64/1.18 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 5.64/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.64/1.18 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 5.64/1.18 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 5.64/1.18 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 5.64/1.18 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 26679 completed with status 0
% 5.64/1.18 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 5.64/1.18 # Preprocessing class: FSMSSMSSSSSNFFN.
% 5.64/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.64/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.64/1.18 # No SInE strategy applied
% 5.64/1.18 # Search class: FUUPM-FFSF21-MFFFFFNN
% 5.64/1.18 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.64/1.18 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 5.64/1.18 # Preprocessing time : 0.001 s
% 5.64/1.18 # Presaturation interreduction done
% 5.64/1.18
% 5.64/1.18 # Proof found!
% 5.64/1.18 # SZS status Unsatisfiable
% 5.64/1.18 # SZS output start CNFRefutation
% See solution above
% 5.64/1.18 # Parsed axioms : 16
% 5.64/1.18 # Removed by relevancy pruning/SinE : 0
% 5.64/1.18 # Initial clauses : 16
% 5.64/1.18 # Removed in clause preprocessing : 2
% 5.64/1.18 # Initial clauses in saturation : 14
% 5.64/1.18 # Processed clauses : 3762
% 5.64/1.18 # ...of these trivial : 2325
% 5.64/1.18 # ...subsumed : 1138
% 5.64/1.18 # ...remaining for further processing : 299
% 5.64/1.18 # Other redundant clauses eliminated : 0
% 5.64/1.18 # Clauses deleted for lack of memory : 0
% 5.64/1.18 # Backward-subsumed : 1
% 5.64/1.18 # Backward-rewritten : 38
% 5.64/1.18 # Generated clauses : 51805
% 5.64/1.18 # ...of the previous two non-redundant : 43862
% 5.64/1.18 # ...aggressively subsumed : 0
% 5.64/1.18 # Contextual simplify-reflections : 0
% 5.64/1.18 # Paramodulations : 51805
% 5.64/1.18 # Factorizations : 0
% 5.64/1.18 # NegExts : 0
% 5.64/1.18 # Equation resolutions : 0
% 5.64/1.18 # Disequality decompositions : 0
% 5.64/1.18 # Total rewrite steps : 189254
% 5.64/1.18 # ...of those cached : 157829
% 5.64/1.18 # Propositional unsat checks : 0
% 5.64/1.18 # Propositional check models : 0
% 5.64/1.18 # Propositional check unsatisfiable : 0
% 5.64/1.18 # Propositional clauses : 0
% 5.64/1.18 # Propositional clauses after purity: 0
% 5.64/1.18 # Propositional unsat core size : 0
% 5.64/1.18 # Propositional preprocessing time : 0.000
% 5.64/1.18 # Propositional encoding time : 0.000
% 5.64/1.18 # Propositional solver time : 0.000
% 5.64/1.18 # Success case prop preproc time : 0.000
% 5.64/1.18 # Success case prop encoding time : 0.000
% 5.64/1.18 # Success case prop solver time : 0.000
% 5.64/1.18 # Current number of processed clauses : 247
% 5.64/1.18 # Positive orientable unit clauses : 232
% 5.64/1.18 # Positive unorientable unit clauses: 15
% 5.64/1.18 # Negative unit clauses : 0
% 5.64/1.18 # Non-unit-clauses : 0
% 5.64/1.18 # Current number of unprocessed clauses: 39621
% 5.64/1.18 # ...number of literals in the above : 39621
% 5.64/1.18 # Current number of archived formulas : 0
% 5.64/1.18 # Current number of archived clauses : 54
% 5.64/1.18 # Clause-clause subsumption calls (NU) : 0
% 5.64/1.18 # Rec. Clause-clause subsumption calls : 0
% 5.64/1.18 # Non-unit clause-clause subsumptions : 0
% 5.64/1.18 # Unit Clause-clause subsumption calls : 453
% 5.64/1.18 # Rewrite failures with RHS unbound : 0
% 5.64/1.18 # BW rewrite match attempts : 1539
% 5.64/1.18 # BW rewrite match successes : 139
% 5.64/1.18 # Condensation attempts : 0
% 5.64/1.18 # Condensation successes : 0
% 5.64/1.18 # Termbank termtop insertions : 1173100
% 5.64/1.18 # Search garbage collected termcells : 2
% 5.64/1.18
% 5.64/1.18 # -------------------------------------------------
% 5.64/1.18 # User time : 0.636 s
% 5.64/1.18 # System time : 0.028 s
% 5.64/1.18 # Total time : 0.664 s
% 5.64/1.18 # Maximum resident set size: 1588 pages
% 5.64/1.18
% 5.64/1.18 # -------------------------------------------------
% 5.64/1.18 # User time : 3.140 s
% 5.64/1.18 # System time : 0.167 s
% 5.64/1.18 # Total time : 3.307 s
% 5.64/1.18 # Maximum resident set size: 1692 pages
% 5.64/1.18 % E---3.1 exiting
%------------------------------------------------------------------------------