TSTP Solution File: RNG025-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG025-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 19:14:46 EDT 2023
% Result : Unsatisfiable 7.78s 1.39s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 6 RR)
% Number of literals : 47 ( 46 equ; 4 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/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',additive_inverse_additive_inverse) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',commutativity_for_addition) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',distribute1) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',distribute2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',right_alternative) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',right_multiplicative_zero) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',right_additive_identity) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.p',left_alternative) ).
cnf(prove_flexible_law,negated_conjecture,
associator(x,y,x) != additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.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/sandbox2/tmp/tmp.1Dgcrig7UN/E---3.1_6963.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,plain,
additive_inverse(multiply(X1,X2)) = multiply(X1,additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_17,c_0_31]) ).
cnf(c_0_34,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_35,plain,
add(X1,add(X2,X3)) = add(X2,add(X3,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
associator(x,y,x) != additive_identity,
prove_flexible_law ).
cnf(c_0_37,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_38,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_39,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_33,c_0_34]),c_0_33]),c_0_33]) ).
cnf(c_0_40,plain,
add(X1,add(X2,X3)) = add(X3,add(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_41,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_42,negated_conjecture,
add(multiply(multiply(x,y),x),additive_inverse(multiply(x,multiply(y,x)))) != additive_identity,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,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_38,c_0_39]),c_0_22]),c_0_22]),c_0_40]),c_0_41]),c_0_40]),c_0_41]) ).
cnf(c_0_44,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_42,c_0_33]),c_0_33]) ).
cnf(c_0_45,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_43,c_0_16]) ).
cnf(c_0_46,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_44,c_0_45]),c_0_22]),c_0_22]),c_0_14]),c_0_26]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : RNG025-6 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n010.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 19:36:05 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.1Dgcrig7UN/E---3.1_6963.p
% 7.78/1.39 # Version: 3.1pre001
% 7.78/1.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 7.78/1.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.78/1.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.78/1.39 # Starting new_bool_3 with 300s (1) cores
% 7.78/1.39 # Starting new_bool_1 with 300s (1) cores
% 7.78/1.39 # Starting sh5l with 300s (1) cores
% 7.78/1.39 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 7041 completed with status 0
% 7.78/1.39 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 7.78/1.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 7.78/1.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.78/1.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.78/1.39 # No SInE strategy applied
% 7.78/1.39 # Search class: FUUPM-FFSF21-MFFFFFNN
% 7.78/1.39 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.78/1.39 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 7.78/1.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.78/1.39 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 7.78/1.39 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 7.78/1.39 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 7.78/1.39 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 7052 completed with status 0
% 7.78/1.39 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 7.78/1.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 7.78/1.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.78/1.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.78/1.39 # No SInE strategy applied
% 7.78/1.39 # Search class: FUUPM-FFSF21-MFFFFFNN
% 7.78/1.39 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.78/1.39 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 7.78/1.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.78/1.39 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 7.78/1.39 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 7.78/1.39 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 7.78/1.39 # Preprocessing time : 0.001 s
% 7.78/1.39 # Presaturation interreduction done
% 7.78/1.39
% 7.78/1.39 # Proof found!
% 7.78/1.39 # SZS status Unsatisfiable
% 7.78/1.40 # SZS output start CNFRefutation
% See solution above
% 7.78/1.40 # Parsed axioms : 16
% 7.78/1.40 # Removed by relevancy pruning/SinE : 0
% 7.78/1.40 # Initial clauses : 16
% 7.78/1.40 # Removed in clause preprocessing : 2
% 7.78/1.40 # Initial clauses in saturation : 14
% 7.78/1.40 # Processed clauses : 3762
% 7.78/1.40 # ...of these trivial : 2325
% 7.78/1.40 # ...subsumed : 1138
% 7.78/1.40 # ...remaining for further processing : 299
% 7.78/1.40 # Other redundant clauses eliminated : 0
% 7.78/1.40 # Clauses deleted for lack of memory : 0
% 7.78/1.40 # Backward-subsumed : 1
% 7.78/1.40 # Backward-rewritten : 38
% 7.78/1.40 # Generated clauses : 51805
% 7.78/1.40 # ...of the previous two non-redundant : 43862
% 7.78/1.40 # ...aggressively subsumed : 0
% 7.78/1.40 # Contextual simplify-reflections : 0
% 7.78/1.40 # Paramodulations : 51805
% 7.78/1.40 # Factorizations : 0
% 7.78/1.40 # NegExts : 0
% 7.78/1.40 # Equation resolutions : 0
% 7.78/1.40 # Total rewrite steps : 189254
% 7.78/1.40 # Propositional unsat checks : 0
% 7.78/1.40 # Propositional check models : 0
% 7.78/1.40 # Propositional check unsatisfiable : 0
% 7.78/1.40 # Propositional clauses : 0
% 7.78/1.40 # Propositional clauses after purity: 0
% 7.78/1.40 # Propositional unsat core size : 0
% 7.78/1.40 # Propositional preprocessing time : 0.000
% 7.78/1.40 # Propositional encoding time : 0.000
% 7.78/1.40 # Propositional solver time : 0.000
% 7.78/1.40 # Success case prop preproc time : 0.000
% 7.78/1.40 # Success case prop encoding time : 0.000
% 7.78/1.40 # Success case prop solver time : 0.000
% 7.78/1.40 # Current number of processed clauses : 247
% 7.78/1.40 # Positive orientable unit clauses : 232
% 7.78/1.40 # Positive unorientable unit clauses: 15
% 7.78/1.40 # Negative unit clauses : 0
% 7.78/1.40 # Non-unit-clauses : 0
% 7.78/1.40 # Current number of unprocessed clauses: 39621
% 7.78/1.40 # ...number of literals in the above : 39621
% 7.78/1.40 # Current number of archived formulas : 0
% 7.78/1.40 # Current number of archived clauses : 54
% 7.78/1.40 # Clause-clause subsumption calls (NU) : 0
% 7.78/1.40 # Rec. Clause-clause subsumption calls : 0
% 7.78/1.40 # Non-unit clause-clause subsumptions : 0
% 7.78/1.40 # Unit Clause-clause subsumption calls : 453
% 7.78/1.40 # Rewrite failures with RHS unbound : 0
% 7.78/1.40 # BW rewrite match attempts : 1539
% 7.78/1.40 # BW rewrite match successes : 139
% 7.78/1.40 # Condensation attempts : 0
% 7.78/1.40 # Condensation successes : 0
% 7.78/1.40 # Termbank termtop insertions : 1173097
% 7.78/1.40
% 7.78/1.40 # -------------------------------------------------
% 7.78/1.40 # User time : 0.886 s
% 7.78/1.40 # System time : 0.037 s
% 7.78/1.40 # Total time : 0.923 s
% 7.78/1.40 # Maximum resident set size: 1564 pages
% 7.78/1.40
% 7.78/1.40 # -------------------------------------------------
% 7.78/1.40 # User time : 4.474 s
% 7.78/1.40 # System time : 0.175 s
% 7.78/1.40 # Total time : 4.649 s
% 7.78/1.40 # Maximum resident set size: 1684 pages
% 7.78/1.40 % E---3.1 exiting
% 7.78/1.40 % E---3.1 exiting
%------------------------------------------------------------------------------