TSTP Solution File: BOO008-4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : BOO008-4 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Sat May 4 07:27:01 EDT 2024
% Result : Unsatisfiable 1.26s 0.65s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 6 RR)
% Number of literals : 48 ( 47 equ; 5 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',distributivity1) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',multiplicative_id1) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',commutativity_of_multiply) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',commutativity_of_add) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',multiplicative_inverse1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',additive_id1) ).
cnf(distributivity2,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',distributivity2) ).
cnf(prove_associativity,negated_conjecture,
add(a,add(b,c)) != add(add(a,b),c),
file('/export/starexec/sandbox2/tmp/tmp.rvsTnqfC9M/E---3.1_4383.p',prove_associativity) ).
cnf(c_0_9,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity1 ).
cnf(c_0_10,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_11,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_12,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_13,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
multiply(multiplicative_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_16,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_17,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_18,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity2 ).
cnf(c_0_19,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]) ).
cnf(c_0_20,plain,
multiply(add(X1,X2),add(X3,X1)) = add(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_21,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_17]) ).
cnf(c_0_22,plain,
add(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_15]),c_0_19]),c_0_11]) ).
cnf(c_0_23,plain,
add(multiply(add(X1,X2),X3),add(X1,multiply(X2,X4))) = multiply(add(X1,X2),add(X3,add(X1,X4))),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_24,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_26,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_14]) ).
cnf(c_0_27,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_28,plain,
multiply(X1,add(X2,add(X1,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_21]),c_0_15]),c_0_22]),c_0_21]) ).
cnf(c_0_29,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_30,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_25]) ).
cnf(c_0_31,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_17]) ).
cnf(c_0_32,plain,
add(X1,add(X2,add(X1,X3))) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15]) ).
cnf(c_0_33,plain,
add(X1,add(X2,X1)) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_15]) ).
cnf(c_0_34,plain,
multiply(X1,add(X2,inverse(X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).
cnf(c_0_35,plain,
multiply(X1,inverse(inverse(inverse(X1)))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]) ).
cnf(c_0_36,plain,
add(X1,add(X2,add(X3,X1))) = add(X2,add(X3,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
add(a,add(b,c)) != add(add(a,b),c),
inference(fof_simplification,[status(thm)],[prove_associativity]) ).
cnf(c_0_38,plain,
multiply(X1,add(add(X2,inverse(X1)),X3)) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_18]) ).
cnf(c_0_39,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_35]),c_0_17]),c_0_15]),c_0_31]) ).
cnf(c_0_40,plain,
add(X1,add(add(X2,X1),X3)) = add(add(X2,X1),X3),
inference(spm,[status(thm)],[c_0_36,c_0_15]) ).
cnf(c_0_41,negated_conjecture,
add(a,add(b,c)) != add(add(a,b),c),
c_0_37 ).
cnf(c_0_42,plain,
add(add(X1,X2),X3) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_38]),c_0_26]),c_0_39]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
add(c,add(a,b)) != add(a,add(b,c)),
inference(rw,[status(thm)],[c_0_41,c_0_15]) ).
cnf(c_0_44,plain,
add(X1,add(X2,X3)) = add(X3,add(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
add(b,add(a,c)) != add(a,add(b,c)),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_33]),c_0_42]),c_0_42]),c_0_32]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : BOO008-4 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n024.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 11:50:35 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.23/0.53 Running first-order model finding
% 0.23/0.53 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.rvsTnqfC9M/E---3.1_4383.p
% 1.26/0.65 # Version: 3.1.0
% 1.26/0.65 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.26/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.26/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.26/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.26/0.65 # Starting sh5l with 300s (1) cores
% 1.26/0.65 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4462 completed with status 0
% 1.26/0.65 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.26/0.65 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.26/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.26/0.65 # No SInE strategy applied
% 1.26/0.65 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1.26/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.65 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.26/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.26/0.65 # Starting new_bool_3 with 136s (1) cores
% 1.26/0.65 # Starting new_bool_1 with 136s (1) cores
% 1.26/0.65 # Starting sh5l with 136s (1) cores
% 1.26/0.65 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4469 completed with status 0
% 1.26/0.65 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.26/0.65 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.26/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.26/0.65 # No SInE strategy applied
% 1.26/0.65 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1.26/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.26/0.65 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.26/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.26/0.65 # Preprocessing time : 0.001 s
% 1.26/0.65
% 1.26/0.65 # Proof found!
% 1.26/0.65 # SZS status Unsatisfiable
% 1.26/0.65 # SZS output start CNFRefutation
% See solution above
% 1.26/0.65 # Parsed axioms : 9
% 1.26/0.65 # Removed by relevancy pruning/SinE : 0
% 1.26/0.65 # Initial clauses : 9
% 1.26/0.65 # Removed in clause preprocessing : 0
% 1.26/0.65 # Initial clauses in saturation : 9
% 1.26/0.65 # Processed clauses : 454
% 1.26/0.65 # ...of these trivial : 200
% 1.26/0.65 # ...subsumed : 115
% 1.26/0.65 # ...remaining for further processing : 139
% 1.26/0.65 # Other redundant clauses eliminated : 0
% 1.26/0.65 # Clauses deleted for lack of memory : 0
% 1.26/0.65 # Backward-subsumed : 0
% 1.26/0.65 # Backward-rewritten : 38
% 1.26/0.65 # Generated clauses : 11317
% 1.26/0.65 # ...of the previous two non-redundant : 7368
% 1.26/0.65 # ...aggressively subsumed : 0
% 1.26/0.65 # Contextual simplify-reflections : 0
% 1.26/0.65 # Paramodulations : 11317
% 1.26/0.65 # Factorizations : 0
% 1.26/0.65 # NegExts : 0
% 1.26/0.65 # Equation resolutions : 0
% 1.26/0.65 # Disequality decompositions : 0
% 1.26/0.65 # Total rewrite steps : 12626
% 1.26/0.65 # ...of those cached : 10299
% 1.26/0.65 # Propositional unsat checks : 0
% 1.26/0.65 # Propositional check models : 0
% 1.26/0.65 # Propositional check unsatisfiable : 0
% 1.26/0.65 # Propositional clauses : 0
% 1.26/0.65 # Propositional clauses after purity: 0
% 1.26/0.65 # Propositional unsat core size : 0
% 1.26/0.65 # Propositional preprocessing time : 0.000
% 1.26/0.65 # Propositional encoding time : 0.000
% 1.26/0.65 # Propositional solver time : 0.000
% 1.26/0.65 # Success case prop preproc time : 0.000
% 1.26/0.65 # Success case prop encoding time : 0.000
% 1.26/0.65 # Success case prop solver time : 0.000
% 1.26/0.65 # Current number of processed clauses : 101
% 1.26/0.65 # Positive orientable unit clauses : 95
% 1.26/0.65 # Positive unorientable unit clauses: 6
% 1.26/0.65 # Negative unit clauses : 0
% 1.26/0.65 # Non-unit-clauses : 0
% 1.26/0.65 # Current number of unprocessed clauses: 6782
% 1.26/0.65 # ...number of literals in the above : 6782
% 1.26/0.65 # Current number of archived formulas : 0
% 1.26/0.65 # Current number of archived clauses : 38
% 1.26/0.65 # Clause-clause subsumption calls (NU) : 0
% 1.26/0.65 # Rec. Clause-clause subsumption calls : 0
% 1.26/0.65 # Non-unit clause-clause subsumptions : 0
% 1.26/0.65 # Unit Clause-clause subsumption calls : 22
% 1.26/0.65 # Rewrite failures with RHS unbound : 0
% 1.26/0.65 # BW rewrite match attempts : 469
% 1.26/0.65 # BW rewrite match successes : 151
% 1.26/0.65 # Condensation attempts : 0
% 1.26/0.65 # Condensation successes : 0
% 1.26/0.65 # Termbank termtop insertions : 114292
% 1.26/0.65 # Search garbage collected termcells : 2
% 1.26/0.65
% 1.26/0.65 # -------------------------------------------------
% 1.26/0.65 # User time : 0.112 s
% 1.26/0.65 # System time : 0.005 s
% 1.26/0.65 # Total time : 0.117 s
% 1.26/0.65 # Maximum resident set size: 1556 pages
% 1.26/0.65
% 1.26/0.65 # -------------------------------------------------
% 1.26/0.65 # User time : 0.542 s
% 1.26/0.65 # System time : 0.013 s
% 1.26/0.65 # Total time : 0.555 s
% 1.26/0.65 # Maximum resident set size: 1688 pages
% 1.26/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------