TSTP Solution File: RNG025-5 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG025-5 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:15:23 EDT 2023
% Result : Unsatisfiable 1425.89s 201.99s
% Output : CNFRefutation 1425.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 7 RR)
% Number of literals : 43 ( 42 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',additive_inverse_additive_inverse) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',commutativity_for_addition) ).
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.iBCUMejVJ5/E---3.1_10938.p',associator) ).
cnf(prove_equation,negated_conjecture,
add(associator(x,y,z),associator(x,z,y)) != additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',prove_equation) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',right_alternative) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',distribute1) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.iBCUMejVJ5/E---3.1_10938.p',distribute2) ).
cnf(c_0_10,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_11,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_12,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_13,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_15,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_17,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_19,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
add(associator(x,y,z),associator(x,z,y)) != additive_identity,
prove_equation ).
cnf(c_0_21,plain,
associator(X1,X2,X3) = add(additive_inverse(multiply(X1,multiply(X2,X3))),multiply(multiply(X1,X2),X3)),
inference(rw,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_22,plain,
additive_inverse(add(additive_inverse(X1),X2)) = add(X1,additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_23,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_24,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_25,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_26,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_27,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_28,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_10]) ).
cnf(c_0_29,negated_conjecture,
add(additive_inverse(multiply(x,multiply(y,z))),add(multiply(multiply(x,y),z),add(additive_inverse(multiply(x,multiply(z,y))),multiply(multiply(x,z),y)))) != additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_10]) ).
cnf(c_0_30,plain,
add(additive_inverse(X1),X2) = additive_inverse(add(X1,additive_inverse(X2))),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_31,plain,
add(X1,additive_inverse(X2)) = additive_inverse(add(X2,additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_32,plain,
add(X1,additive_inverse(add(X2,X1))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16]) ).
cnf(c_0_33,plain,
add(multiply(X1,multiply(X2,X2)),add(multiply(X1,multiply(X3,X3)),add(multiply(multiply(X1,X3),X2),multiply(multiply(X1,X2),X3)))) = add(multiply(X1,multiply(X2,X2)),add(multiply(X1,multiply(X3,X2)),add(multiply(X1,multiply(X2,X3)),multiply(X1,multiply(X3,X3))))),
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(rw,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_26]),c_0_24]),c_0_26]),c_0_24]),c_0_10]),c_0_27]),c_0_26]),c_0_25]),c_0_26]),c_0_25]),c_0_10]) ).
cnf(c_0_34,plain,
add(X1,additive_inverse(add(X2,add(X1,X3)))) = additive_inverse(add(X2,X3)),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
additive_inverse(add(multiply(x,multiply(y,z)),additive_inverse(add(multiply(multiply(x,y),z),additive_inverse(add(multiply(x,multiply(z,y)),additive_inverse(multiply(multiply(x,z),y)))))))) != additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_36,plain,
add(X1,additive_inverse(add(X2,additive_inverse(X3)))) = additive_inverse(add(X2,additive_inverse(add(X1,X3)))),
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_30,c_0_31]),c_0_10]),c_0_30]),c_0_10]),c_0_30]),c_0_14]) ).
cnf(c_0_37,plain,
add(X1,add(X2,add(X3,additive_inverse(X1)))) = add(X2,X3),
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_38,plain,
add(multiply(X1,multiply(X2,X3)),add(multiply(X1,multiply(X3,X2)),additive_inverse(add(multiply(X1,multiply(X3,X3)),add(multiply(multiply(X1,X2),X3),multiply(multiply(X1,X3),X2)))))) = additive_inverse(multiply(X1,multiply(X3,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_10]),c_0_10]),c_0_34]) ).
cnf(c_0_39,negated_conjecture,
additive_inverse(add(multiply(x,multiply(y,z)),add(multiply(x,multiply(z,y)),additive_inverse(add(multiply(multiply(x,y),z),multiply(multiply(x,z),y)))))) != additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_14]) ).
cnf(c_0_40,plain,
add(multiply(multiply(X1,X2),X3),multiply(multiply(X1,X3),X2)) = add(multiply(X1,multiply(X2,X3)),multiply(X1,multiply(X3,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_10]),c_0_10]),c_0_37]) ).
cnf(c_0_41,plain,
additive_inverse(additive_identity) = additive_identity,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[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_32]),c_0_11]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : RNG025-5 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 19:50:13 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.iBCUMejVJ5/E---3.1_10938.p
% 1425.89/201.99 # Version: 3.1pre001
% 1425.89/201.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1425.89/201.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1425.89/201.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1425.89/201.99 # Starting new_bool_3 with 300s (1) cores
% 1425.89/201.99 # Starting new_bool_1 with 300s (1) cores
% 1425.89/201.99 # Starting sh5l with 300s (1) cores
% 1425.89/201.99 # new_bool_1 with pid 11017 completed with status 0
% 1425.89/201.99 # Result found by new_bool_1
% 1425.89/201.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1425.89/201.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1425.89/201.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1425.89/201.99 # Starting new_bool_3 with 300s (1) cores
% 1425.89/201.99 # Starting new_bool_1 with 300s (1) cores
% 1425.89/201.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1425.89/201.99 # Search class: FUUPM-FFMF32-MFFFFFNN
% 1425.89/201.99 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1425.89/201.99 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 1425.89/201.99 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 11021 completed with status 7
% 1425.89/201.99 # Starting new_bool_1 with 31s (1) cores
% 1425.89/201.99 # new_bool_1 with pid 11690 completed with status 7
% 1425.89/201.99 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 28s (1) cores
% 1425.89/201.99 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 11741 completed with status 7
% 1425.89/201.99 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 28s (1) cores
% 1425.89/201.99 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 11748 completed with status 0
% 1425.89/201.99 # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 1425.89/201.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1425.89/201.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1425.89/201.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1425.89/201.99 # Starting new_bool_3 with 300s (1) cores
% 1425.89/201.99 # Starting new_bool_1 with 300s (1) cores
% 1425.89/201.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1425.89/201.99 # Search class: FUUPM-FFMF32-MFFFFFNN
% 1425.89/201.99 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1425.89/201.99 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 1425.89/201.99 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 11021 completed with status 7
% 1425.89/201.99 # Starting new_bool_1 with 31s (1) cores
% 1425.89/201.99 # new_bool_1 with pid 11690 completed with status 7
% 1425.89/201.99 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 28s (1) cores
% 1425.89/201.99 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 11741 completed with status 7
% 1425.89/201.99 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 28s (1) cores
% 1425.89/201.99 # Preprocessing time : 0.001 s
% 1425.89/201.99 # Presaturation interreduction done
% 1425.89/201.99
% 1425.89/201.99 # Proof found!
% 1425.89/201.99 # SZS status Unsatisfiable
% 1425.89/201.99 # SZS output start CNFRefutation
% See solution above
% 1425.89/201.99 # Parsed axioms : 23
% 1425.89/201.99 # Removed by relevancy pruning/SinE : 1
% 1425.89/201.99 # Initial clauses : 22
% 1425.89/201.99 # Removed in clause preprocessing : 0
% 1425.89/201.99 # Initial clauses in saturation : 22
% 1425.89/201.99 # Processed clauses : 1835
% 1425.89/201.99 # ...of these trivial : 754
% 1425.89/201.99 # ...subsumed : 920
% 1425.89/201.99 # ...remaining for further processing : 161
% 1425.89/201.99 # Other redundant clauses eliminated : 0
% 1425.89/201.99 # Clauses deleted for lack of memory : 0
% 1425.89/201.99 # Backward-subsumed : 0
% 1425.89/201.99 # Backward-rewritten : 24
% 1425.89/201.99 # Generated clauses : 27851
% 1425.89/201.99 # ...of the previous two non-redundant : 24397
% 1425.89/201.99 # ...aggressively subsumed : 0
% 1425.89/201.99 # Contextual simplify-reflections : 0
% 1425.89/201.99 # Paramodulations : 27851
% 1425.89/201.99 # Factorizations : 0
% 1425.89/201.99 # NegExts : 0
% 1425.89/201.99 # Equation resolutions : 0
% 1425.89/201.99 # Total rewrite steps : 8308645
% 1425.89/201.99 # Propositional unsat checks : 0
% 1425.89/201.99 # Propositional check models : 0
% 1425.89/201.99 # Propositional check unsatisfiable : 0
% 1425.89/201.99 # Propositional clauses : 0
% 1425.89/201.99 # Propositional clauses after purity: 0
% 1425.89/201.99 # Propositional unsat core size : 0
% 1425.89/201.99 # Propositional preprocessing time : 0.000
% 1425.89/201.99 # Propositional encoding time : 0.000
% 1425.89/201.99 # Propositional solver time : 0.000
% 1425.89/201.99 # Success case prop preproc time : 0.000
% 1425.89/201.99 # Success case prop encoding time : 0.000
% 1425.89/201.99 # Success case prop solver time : 0.000
% 1425.89/201.99 # Current number of processed clauses : 120
% 1425.89/201.99 # Positive orientable unit clauses : 86
% 1425.89/201.99 # Positive unorientable unit clauses: 32
% 1425.89/201.99 # Negative unit clauses : 2
% 1425.89/201.99 # Non-unit-clauses : 0
% 1425.89/201.99 # Current number of unprocessed clauses: 22330
% 1425.89/201.99 # ...number of literals in the above : 22330
% 1425.89/201.99 # Current number of archived formulas : 0
% 1425.89/201.99 # Current number of archived clauses : 41
% 1425.89/201.99 # Clause-clause subsumption calls (NU) : 0
% 1425.89/201.99 # Rec. Clause-clause subsumption calls : 0
% 1425.89/201.99 # Non-unit clause-clause subsumptions : 0
% 1425.89/201.99 # Unit Clause-clause subsumption calls : 176
% 1425.89/201.99 # Rewrite failures with RHS unbound : 0
% 1425.89/201.99 # BW rewrite match attempts : 3311
% 1425.89/201.99 # BW rewrite match successes : 199
% 1425.89/201.99 # Condensation attempts : 0
% 1425.89/201.99 # Condensation successes : 0
% 1425.89/201.99 # Termbank termtop insertions : 15712647
% 1425.89/201.99
% 1425.89/201.99 # -------------------------------------------------
% 1425.89/201.99 # User time : 196.036 s
% 1425.89/201.99 # System time : 3.926 s
% 1425.89/201.99 # Total time : 199.961 s
% 1425.89/201.99 # Maximum resident set size: 1616 pages
% 1425.89/201.99
% 1425.89/201.99 # -------------------------------------------------
% 1425.89/201.99 # User time : 196.036 s
% 1425.89/201.99 # System time : 3.936 s
% 1425.89/201.99 # Total time : 199.972 s
% 1425.89/201.99 # Maximum resident set size: 1680 pages
% 1425.89/201.99 % E---3.1 exiting
%------------------------------------------------------------------------------