TSTP Solution File: RNG008-7 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG008-7 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:42 EDT 2023
% Result : Unsatisfiable 0.17s 0.42s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 12 RR)
% Number of literals : 53 ( 52 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',left_additive_identity) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',right_additive_identity) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',distribute1) ).
cnf(boolean_ring,hypothesis,
multiply(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',boolean_ring) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',commutativity_for_addition) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',distribute2) ).
cnf(associativity_for_multiplication,axiom,
multiply(X1,multiply(X2,X3)) = multiply(multiply(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',associativity_for_multiplication) ).
cnf(a_times_b_is_c,negated_conjecture,
multiply(a,b) = c,
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',a_times_b_is_c) ).
cnf(prove_commutativity,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p',prove_commutativity) ).
cnf(c_0_11,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_12,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_13,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_14,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_16,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_17,hypothesis,
multiply(X1,X1) = X1,
boolean_ring ).
cnf(c_0_18,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_19,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_15]) ).
cnf(c_0_20,hypothesis,
multiply(X1,add(X2,X1)) = add(X1,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_22,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_23,hypothesis,
add(X1,multiply(X1,additive_identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_17]) ).
cnf(c_0_24,hypothesis,
multiply(add(X1,X2),X2) = add(X2,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_18]) ).
cnf(c_0_25,hypothesis,
multiply(X1,add(X1,X2)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,hypothesis,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]),c_0_12]) ).
cnf(c_0_27,axiom,
multiply(X1,multiply(X2,X3)) = multiply(multiply(X1,X2),X3),
associativity_for_multiplication ).
cnf(c_0_28,negated_conjecture,
multiply(a,b) = c,
a_times_b_is_c ).
cnf(c_0_29,hypothesis,
add(X1,multiply(additive_identity,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_17]) ).
cnf(c_0_30,hypothesis,
add(X1,multiply(X1,additive_inverse(X1))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
multiply(a,multiply(b,X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,hypothesis,
multiply(add(X1,X2),X1) = add(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_33,hypothesis,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_18]),c_0_12]) ).
cnf(c_0_34,hypothesis,
multiply(additive_inverse(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_15]),c_0_19]) ).
cnf(c_0_35,hypothesis,
multiply(add(X1,multiply(X1,X2)),X3) = multiply(X1,multiply(add(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_36,hypothesis,
multiply(c,b) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_17]),c_0_28]) ).
cnf(c_0_37,hypothesis,
add(X1,X1) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_12]),c_0_33]),c_0_34]) ).
cnf(c_0_38,hypothesis,
multiply(X1,multiply(X2,multiply(X1,X2))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_39,hypothesis,
multiply(c,multiply(add(b,c),X1)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_33]) ).
cnf(c_0_40,hypothesis,
add(X1,add(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_37]),c_0_13]) ).
cnf(c_0_41,hypothesis,
add(c,multiply(b,c)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_26]),c_0_24]) ).
cnf(c_0_42,hypothesis,
multiply(X1,multiply(X1,X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_43,hypothesis,
multiply(b,c) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_15]) ).
cnf(c_0_44,hypothesis,
multiply(add(X1,multiply(X2,X1)),X3) = multiply(add(X2,X1),multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_45,negated_conjecture,
multiply(a,c) = c,
inference(spm,[status(thm)],[c_0_42,c_0_28]) ).
cnf(c_0_46,negated_conjecture,
multiply(b,multiply(c,a)) = multiply(b,a),
inference(spm,[status(thm)],[c_0_38,c_0_31]) ).
cnf(c_0_47,hypothesis,
multiply(b,multiply(c,X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
multiply(add(a,c),multiply(c,X1)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_37]),c_0_33]) ).
cnf(c_0_49,negated_conjecture,
multiply(c,a) = multiply(b,a),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,hypothesis,
add(c,multiply(b,a)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_48]),c_0_26]),c_0_20]),c_0_49]) ).
cnf(c_0_51,negated_conjecture,
multiply(b,a) != c,
prove_commutativity ).
cnf(c_0_52,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_50]),c_0_15]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : RNG008-7 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 19:45:49 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.17/0.40 Running first-order theorem proving
% 0.17/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.iannO0NjJR/E---3.1_1264.p
% 0.17/0.42 # Version: 3.1pre001
% 0.17/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.42 # Starting sh5l with 300s (1) cores
% 0.17/0.42 # sh5l with pid 1345 completed with status 0
% 0.17/0.42 # Result found by sh5l
% 0.17/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.42 # Starting sh5l with 300s (1) cores
% 0.17/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.42 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.17/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.42 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.42 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1351 completed with status 0
% 0.17/0.42 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.42 # Starting sh5l with 300s (1) cores
% 0.17/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.42 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.17/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.42 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.42 # Preprocessing time : 0.001 s
% 0.17/0.42 # Presaturation interreduction done
% 0.17/0.42
% 0.17/0.42 # Proof found!
% 0.17/0.42 # SZS status Unsatisfiable
% 0.17/0.42 # SZS output start CNFRefutation
% See solution above
% 0.17/0.42 # Parsed axioms : 12
% 0.17/0.42 # Removed by relevancy pruning/SinE : 0
% 0.17/0.42 # Initial clauses : 12
% 0.17/0.42 # Removed in clause preprocessing : 0
% 0.17/0.42 # Initial clauses in saturation : 12
% 0.17/0.42 # Processed clauses : 240
% 0.17/0.42 # ...of these trivial : 74
% 0.17/0.42 # ...subsumed : 56
% 0.17/0.42 # ...remaining for further processing : 110
% 0.17/0.42 # Other redundant clauses eliminated : 0
% 0.17/0.42 # Clauses deleted for lack of memory : 0
% 0.17/0.42 # Backward-subsumed : 0
% 0.17/0.42 # Backward-rewritten : 30
% 0.17/0.42 # Generated clauses : 2030
% 0.17/0.42 # ...of the previous two non-redundant : 1235
% 0.17/0.42 # ...aggressively subsumed : 0
% 0.17/0.42 # Contextual simplify-reflections : 0
% 0.17/0.42 # Paramodulations : 2030
% 0.17/0.42 # Factorizations : 0
% 0.17/0.42 # NegExts : 0
% 0.17/0.42 # Equation resolutions : 0
% 0.17/0.42 # Total rewrite steps : 2971
% 0.17/0.42 # Propositional unsat checks : 0
% 0.17/0.42 # Propositional check models : 0
% 0.17/0.42 # Propositional check unsatisfiable : 0
% 0.17/0.42 # Propositional clauses : 0
% 0.17/0.42 # Propositional clauses after purity: 0
% 0.17/0.42 # Propositional unsat core size : 0
% 0.17/0.42 # Propositional preprocessing time : 0.000
% 0.17/0.42 # Propositional encoding time : 0.000
% 0.17/0.42 # Propositional solver time : 0.000
% 0.17/0.42 # Success case prop preproc time : 0.000
% 0.17/0.42 # Success case prop encoding time : 0.000
% 0.17/0.42 # Success case prop solver time : 0.000
% 0.17/0.42 # Current number of processed clauses : 69
% 0.17/0.42 # Positive orientable unit clauses : 65
% 0.17/0.42 # Positive unorientable unit clauses: 3
% 0.17/0.42 # Negative unit clauses : 1
% 0.17/0.42 # Non-unit-clauses : 0
% 0.17/0.42 # Current number of unprocessed clauses: 939
% 0.17/0.42 # ...number of literals in the above : 939
% 0.17/0.42 # Current number of archived formulas : 0
% 0.17/0.42 # Current number of archived clauses : 41
% 0.17/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.42 # Non-unit clause-clause subsumptions : 0
% 0.17/0.42 # Unit Clause-clause subsumption calls : 8
% 0.17/0.42 # Rewrite failures with RHS unbound : 0
% 0.17/0.42 # BW rewrite match attempts : 132
% 0.17/0.42 # BW rewrite match successes : 78
% 0.17/0.42 # Condensation attempts : 0
% 0.17/0.42 # Condensation successes : 0
% 0.17/0.42 # Termbank termtop insertions : 19664
% 0.17/0.42
% 0.17/0.42 # -------------------------------------------------
% 0.17/0.42 # User time : 0.012 s
% 0.17/0.42 # System time : 0.004 s
% 0.17/0.42 # Total time : 0.015 s
% 0.17/0.42 # Maximum resident set size: 1608 pages
% 0.17/0.42
% 0.17/0.42 # -------------------------------------------------
% 0.17/0.42 # User time : 0.012 s
% 0.17/0.42 # System time : 0.006 s
% 0.17/0.42 # Total time : 0.018 s
% 0.17/0.42 # Maximum resident set size: 1672 pages
% 0.17/0.42 % E---3.1 exiting
% 0.17/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------