TSTP Solution File: RNG021-6 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : RNG021-6 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Mon Jun 24 14:01:22 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 26 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.p',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.p',additive_inverse_additive_inverse) ).
cnf(prove_linearised_form3,negated_conjecture,
associator(add(u,v),x,y) != add(associator(u,x,y),associator(v,x,y)),
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.p',prove_linearised_form3) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.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.MhQ81M80GP/E---3.1_1700.p',associator) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.MhQ81M80GP/E---3.1_1700.p',distribute2) ).
cnf(c_0_8,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_9,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_10,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_11,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_13,negated_conjecture,
associator(add(u,v),x,y) != add(associator(u,x,y),associator(v,x,y)),
inference(fof_simplification,[status(thm)],[prove_linearised_form3]) ).
cnf(c_0_14,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_16,negated_conjecture,
associator(add(u,v),x,y) != add(associator(u,x,y),associator(v,x,y)),
c_0_13 ).
cnf(c_0_17,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_18,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_20,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
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_18,c_0_18]),c_0_15]) ).
cnf(c_0_22,negated_conjecture,
add(multiply(multiply(u,x),y),add(multiply(multiply(v,x),y),additive_inverse(add(multiply(u,multiply(x,y)),multiply(v,multiply(x,y)))))) != add(multiply(multiply(u,x),y),add(additive_inverse(multiply(u,multiply(x,y))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_8]),c_0_20]),c_0_20]),c_0_20]),c_0_8]) ).
cnf(c_0_23,plain,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_24,plain,
add(X1,X2) = add(X2,X1),
c_0_15 ).
cnf(c_0_25,plain,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
c_0_8 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG021-6 : TPTP v8.2.0. Released v1.0.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 14:22:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.MhQ81M80GP/E---3.1_1700.p
% 0.20/0.49 # Version: 3.2.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1783 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.49 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.20/0.49 # U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1793 completed with status 0
% 0.20/0.49 # Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.20/0.49 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 16
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 16
% 0.20/0.49 # Removed in clause preprocessing : 2
% 0.20/0.49 # Initial clauses in saturation : 14
% 0.20/0.49 # Processed clauses : 32
% 0.20/0.49 # ...of these trivial : 6
% 0.20/0.49 # ...subsumed : 3
% 0.20/0.49 # ...remaining for further processing : 23
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 3
% 0.20/0.49 # Generated clauses : 176
% 0.20/0.49 # ...of the previous two non-redundant : 85
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 176
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 255
% 0.20/0.49 # ...of those cached : 144
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 20
% 0.20/0.49 # Positive orientable unit clauses : 18
% 0.20/0.49 # Positive unorientable unit clauses: 1
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 0
% 0.20/0.49 # Current number of unprocessed clauses: 62
% 0.20/0.49 # ...number of literals in the above : 62
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 5
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 32
% 0.20/0.49 # BW rewrite match successes : 18
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1595
% 0.20/0.49 # Search garbage collected termcells : 2
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1596 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.027 s
% 0.20/0.49 # System time : 0.007 s
% 0.20/0.49 # Total time : 0.034 s
% 0.20/0.49 # Maximum resident set size: 1696 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------