TSTP Solution File: BOO028-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO028-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 17:18:14 EDT 2023
% Result : Unsatisfiable 1.27s 0.61s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 4 RR)
% Number of literals : 47 ( 46 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 107 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(l2,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',l2) ).
cnf(l1,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',l1) ).
cnf(associativity_of_multiply,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',associativity_of_multiply) ).
cnf(b1,axiom,
multiply(add(X1,X2),add(X1,inverse(X2))) = X1,
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',b1) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',associativity_of_add) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',commutativity_of_add) ).
cnf(b2,axiom,
add(multiply(X1,X2),multiply(X1,inverse(X2))) = X1,
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',b2) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',commutativity_of_multiply) ).
cnf(prove_multiply_add_property,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
file('/export/starexec/sandbox/tmp/tmp.14ZVwtkjmT/E---3.1_10584.p',prove_multiply_add_property) ).
cnf(c_0_9,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
l2 ).
cnf(c_0_10,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
l1 ).
cnf(c_0_11,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity_of_multiply ).
cnf(c_0_12,plain,
multiply(X1,add(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(add(X2,X1),X3)) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
multiply(add(X1,X2),add(X1,inverse(X2))) = X1,
b1 ).
cnf(c_0_15,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_16,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_17,plain,
multiply(X1,add(X2,inverse(X1))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_19,plain,
add(X1,add(multiply(X2,X1),X3)) = add(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
add(multiply(X1,X2),multiply(X1,inverse(X2))) = X1,
b2 ).
cnf(c_0_21,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_24,plain,
multiply(X1,multiply(X2,inverse(X1))) = multiply(X1,inverse(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,plain,
add(X1,add(X2,multiply(X3,X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_15]) ).
cnf(c_0_26,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
add(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_28,plain,
add(inverse(X1),multiply(X2,X1)) = add(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_29,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
add(X1,multiply(add(X2,inverse(X1)),X3)) = add(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_26]) ).
cnf(c_0_31,plain,
multiply(add(X1,X2),multiply(add(X1,inverse(X2)),X3)) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_32,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_18]),c_0_29]) ).
cnf(c_0_33,plain,
multiply(X1,add(multiply(X2,inverse(X1)),X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_21]) ).
cnf(c_0_34,plain,
add(multiply(X1,X2),add(multiply(X1,inverse(X2)),X3)) = add(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_35,plain,
add(X1,multiply(add(X2,X1),X3)) = add(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,plain,
multiply(X1,add(multiply(X2,X1),X3)) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]) ).
cnf(c_0_37,plain,
add(multiply(X1,X2),multiply(add(X3,X1),X2)) = multiply(add(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_18]) ).
cnf(c_0_38,plain,
add(X1,multiply(X2,add(X3,X1))) = add(X1,multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_39,plain,
multiply(X1,add(multiply(X1,X2),X3)) = multiply(X1,add(X2,X3)),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_40,negated_conjecture,
multiply(a,add(b,c)) != add(multiply(b,a),multiply(c,a)),
prove_multiply_add_property ).
cnf(c_0_41,plain,
multiply(add(X1,X2),add(X3,X2)) = add(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_12]),c_0_38]),c_0_38]) ).
cnf(c_0_42,plain,
add(X1,multiply(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_43,plain,
multiply(X1,add(X2,multiply(X1,X3))) = multiply(X1,add(X3,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_44,negated_conjecture,
add(multiply(a,b),multiply(a,c)) != multiply(a,add(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_23]),c_0_23]) ).
cnf(c_0_45,plain,
add(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : BOO028-1 : TPTP v8.1.2. Released v2.2.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.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 : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 20:54:22 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.14ZVwtkjmT/E---3.1_10584.p
% 1.27/0.61 # Version: 3.1pre001
% 1.27/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.27/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.27/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.27/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.27/0.61 # Starting sh5l with 300s (1) cores
% 1.27/0.61 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10662 completed with status 0
% 1.27/0.61 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.27/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.27/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.27/0.61 # No SInE strategy applied
% 1.27/0.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1.27/0.61 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.27/0.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 1.27/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.27/0.61 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 1.27/0.61 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 1.27/0.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.27/0.61 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 10669 completed with status 0
% 1.27/0.61 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 1.27/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.27/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.27/0.61 # No SInE strategy applied
% 1.27/0.61 # Search class: FUUPM-FFSF21-MFFFFFNN
% 1.27/0.61 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.27/0.61 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 1.27/0.61 # Preprocessing time : 0.001 s
% 1.27/0.61 # Presaturation interreduction done
% 1.27/0.61
% 1.27/0.61 # Proof found!
% 1.27/0.61 # SZS status Unsatisfiable
% 1.27/0.61 # SZS output start CNFRefutation
% See solution above
% 1.27/0.61 # Parsed axioms : 11
% 1.27/0.61 # Removed by relevancy pruning/SinE : 0
% 1.27/0.61 # Initial clauses : 11
% 1.27/0.61 # Removed in clause preprocessing : 0
% 1.27/0.61 # Initial clauses in saturation : 11
% 1.27/0.61 # Processed clauses : 1649
% 1.27/0.61 # ...of these trivial : 608
% 1.27/0.61 # ...subsumed : 830
% 1.27/0.61 # ...remaining for further processing : 211
% 1.27/0.61 # Other redundant clauses eliminated : 0
% 1.27/0.61 # Clauses deleted for lack of memory : 0
% 1.27/0.61 # Backward-subsumed : 0
% 1.27/0.61 # Backward-rewritten : 60
% 1.27/0.61 # Generated clauses : 23423
% 1.27/0.61 # ...of the previous two non-redundant : 13083
% 1.27/0.61 # ...aggressively subsumed : 0
% 1.27/0.61 # Contextual simplify-reflections : 0
% 1.27/0.61 # Paramodulations : 23423
% 1.27/0.61 # Factorizations : 0
% 1.27/0.61 # NegExts : 0
% 1.27/0.61 # Equation resolutions : 0
% 1.27/0.61 # Total rewrite steps : 32525
% 1.27/0.61 # Propositional unsat checks : 0
% 1.27/0.61 # Propositional check models : 0
% 1.27/0.61 # Propositional check unsatisfiable : 0
% 1.27/0.61 # Propositional clauses : 0
% 1.27/0.61 # Propositional clauses after purity: 0
% 1.27/0.61 # Propositional unsat core size : 0
% 1.27/0.61 # Propositional preprocessing time : 0.000
% 1.27/0.61 # Propositional encoding time : 0.000
% 1.27/0.61 # Propositional solver time : 0.000
% 1.27/0.61 # Success case prop preproc time : 0.000
% 1.27/0.61 # Success case prop encoding time : 0.000
% 1.27/0.61 # Success case prop solver time : 0.000
% 1.27/0.61 # Current number of processed clauses : 140
% 1.27/0.61 # Positive orientable unit clauses : 130
% 1.27/0.61 # Positive unorientable unit clauses: 10
% 1.27/0.61 # Negative unit clauses : 0
% 1.27/0.61 # Non-unit-clauses : 0
% 1.27/0.61 # Current number of unprocessed clauses: 11363
% 1.27/0.61 # ...number of literals in the above : 11363
% 1.27/0.61 # Current number of archived formulas : 0
% 1.27/0.61 # Current number of archived clauses : 71
% 1.27/0.61 # Clause-clause subsumption calls (NU) : 0
% 1.27/0.61 # Rec. Clause-clause subsumption calls : 0
% 1.27/0.61 # Non-unit clause-clause subsumptions : 0
% 1.27/0.61 # Unit Clause-clause subsumption calls : 41
% 1.27/0.61 # Rewrite failures with RHS unbound : 80
% 1.27/0.61 # BW rewrite match attempts : 723
% 1.27/0.61 # BW rewrite match successes : 256
% 1.27/0.61 # Condensation attempts : 0
% 1.27/0.61 # Condensation successes : 0
% 1.27/0.61 # Termbank termtop insertions : 205738
% 1.27/0.61
% 1.27/0.61 # -------------------------------------------------
% 1.27/0.61 # User time : 0.116 s
% 1.27/0.61 # System time : 0.004 s
% 1.27/0.61 # Total time : 0.120 s
% 1.27/0.61 # Maximum resident set size: 1516 pages
% 1.27/0.61
% 1.27/0.61 # -------------------------------------------------
% 1.27/0.61 # User time : 0.632 s
% 1.27/0.61 # System time : 0.033 s
% 1.27/0.61 # Total time : 0.665 s
% 1.27/0.61 # Maximum resident set size: 1676 pages
% 1.27/0.61 % E---3.1 exiting
% 1.27/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------