TSTP Solution File: BOO008-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : BOO008-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:00 EDT 2024
% Result : Unsatisfiable 2.11s 0.74s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 5 RR)
% Number of literals : 46 ( 45 equ; 4 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 87 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',multiplicative_id1) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',multiplicative_inverse1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',additive_id1) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',multiplicative_id2) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',commutativity_of_multiply) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',distributivity4) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',commutativity_of_add) ).
cnf(distributivity1,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',distributivity1) ).
cnf(prove_associativity,negated_conjecture,
add(a,add(b,c)) != add(add(a,b),c),
file('/export/starexec/sandbox2/tmp/tmp.erVFD9VsZY/E---3.1_4841.p',prove_associativity) ).
cnf(c_0_11,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
cnf(c_0_12,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_13,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_14,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_16,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_17,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_18,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_20,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_21,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_12]) ).
cnf(c_0_22,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_23,plain,
add(X1,multiply(X1,X2)) = multiply(X1,add(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_24,plain,
add(X1,multiply(X2,X1)) = multiply(X1,add(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_19]) ).
cnf(c_0_25,plain,
multiply(X1,add(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_21]),c_0_13]),c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
add(X1,multiply(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
add(X1,add(X1,X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_22]) ).
cnf(c_0_28,plain,
add(X1,multiply(add(X1,X2),X3)) = add(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_27]),c_0_11]) ).
cnf(c_0_29,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
distributivity1 ).
cnf(c_0_30,plain,
multiply(X1,add(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_31,plain,
multiply(add(X1,X2),add(X2,X3)) = add(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_32,plain,
add(X1,add(multiply(X1,X2),X3)) = add(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(X2,X1)) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_19]) ).
cnf(c_0_34,plain,
add(X1,add(X2,multiply(X1,X3))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_25]) ).
cnf(c_0_35,plain,
add(X1,add(multiply(X2,X1),X3)) = add(X1,X3),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
add(X1,add(X2,multiply(X3,X1))) = add(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_37,plain,
add(add(X1,X2),add(X2,X3)) = add(add(X1,X2),X3),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_38,plain,
add(add(X1,X2),add(X3,X1)) = add(add(X1,X2),X3),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_39,negated_conjecture,
add(a,add(b,c)) != add(add(a,b),c),
inference(fof_simplification,[status(thm)],[prove_associativity]) ).
cnf(c_0_40,plain,
add(add(X1,X2),X3) = add(add(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
add(a,add(b,c)) != add(add(a,b),c),
c_0_39 ).
cnf(c_0_42,plain,
add(add(X1,X2),X3) = add(X2,add(X3,X1)),
inference(spm,[status(thm)],[c_0_22,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_22]) ).
cnf(c_0_44,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_42]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : BOO008-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:44:32 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.erVFD9VsZY/E---3.1_4841.p
% 2.11/0.74 # Version: 3.1.0
% 2.11/0.74 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.11/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.74 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.11/0.74 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.74 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.74 # Starting sh5l with 300s (1) cores
% 2.11/0.74 # sh5l with pid 4922 completed with status 0
% 2.11/0.74 # Result found by sh5l
% 2.11/0.74 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.11/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.74 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.11/0.74 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.74 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.74 # Starting sh5l with 300s (1) cores
% 2.11/0.74 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.11/0.74 # Search class: FUUPM-FFSF21-SFFFFFNN
% 2.11/0.74 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.11/0.74 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.11/0.74 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4930 completed with status 0
% 2.11/0.74 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.11/0.74 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.11/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.74 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.11/0.74 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.74 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.74 # Starting sh5l with 300s (1) cores
% 2.11/0.74 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.11/0.74 # Search class: FUUPM-FFSF21-SFFFFFNN
% 2.11/0.74 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.11/0.74 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.11/0.74 # Preprocessing time : 0.001 s
% 2.11/0.74 # Presaturation interreduction done
% 2.11/0.74
% 2.11/0.74 # Proof found!
% 2.11/0.74 # SZS status Unsatisfiable
% 2.11/0.74 # SZS output start CNFRefutation
% See solution above
% 2.11/0.74 # Parsed axioms : 15
% 2.11/0.74 # Removed by relevancy pruning/SinE : 0
% 2.11/0.74 # Initial clauses : 15
% 2.11/0.74 # Removed in clause preprocessing : 0
% 2.11/0.74 # Initial clauses in saturation : 15
% 2.11/0.74 # Processed clauses : 1981
% 2.11/0.74 # ...of these trivial : 1131
% 2.11/0.74 # ...subsumed : 540
% 2.11/0.74 # ...remaining for further processing : 310
% 2.11/0.74 # Other redundant clauses eliminated : 0
% 2.11/0.74 # Clauses deleted for lack of memory : 0
% 2.11/0.74 # Backward-subsumed : 0
% 2.11/0.74 # Backward-rewritten : 117
% 2.11/0.74 # Generated clauses : 44270
% 2.11/0.74 # ...of the previous two non-redundant : 17132
% 2.11/0.74 # ...aggressively subsumed : 0
% 2.11/0.74 # Contextual simplify-reflections : 0
% 2.11/0.74 # Paramodulations : 44270
% 2.11/0.74 # Factorizations : 0
% 2.11/0.74 # NegExts : 0
% 2.11/0.74 # Equation resolutions : 0
% 2.11/0.74 # Disequality decompositions : 0
% 2.11/0.74 # Total rewrite steps : 66537
% 2.11/0.74 # ...of those cached : 55084
% 2.11/0.74 # Propositional unsat checks : 0
% 2.11/0.74 # Propositional check models : 0
% 2.11/0.74 # Propositional check unsatisfiable : 0
% 2.11/0.74 # Propositional clauses : 0
% 2.11/0.74 # Propositional clauses after purity: 0
% 2.11/0.74 # Propositional unsat core size : 0
% 2.11/0.74 # Propositional preprocessing time : 0.000
% 2.11/0.74 # Propositional encoding time : 0.000
% 2.11/0.74 # Propositional solver time : 0.000
% 2.11/0.74 # Success case prop preproc time : 0.000
% 2.11/0.74 # Success case prop encoding time : 0.000
% 2.11/0.74 # Success case prop solver time : 0.000
% 2.11/0.74 # Current number of processed clauses : 180
% 2.11/0.74 # Positive orientable unit clauses : 177
% 2.11/0.74 # Positive unorientable unit clauses: 3
% 2.11/0.74 # Negative unit clauses : 0
% 2.11/0.74 # Non-unit-clauses : 0
% 2.11/0.74 # Current number of unprocessed clauses: 14588
% 2.11/0.74 # ...number of literals in the above : 14588
% 2.11/0.74 # Current number of archived formulas : 0
% 2.11/0.74 # Current number of archived clauses : 130
% 2.11/0.74 # Clause-clause subsumption calls (NU) : 0
% 2.11/0.74 # Rec. Clause-clause subsumption calls : 0
% 2.11/0.74 # Non-unit clause-clause subsumptions : 0
% 2.11/0.74 # Unit Clause-clause subsumption calls : 19
% 2.11/0.74 # Rewrite failures with RHS unbound : 0
% 2.11/0.74 # BW rewrite match attempts : 861
% 2.11/0.74 # BW rewrite match successes : 322
% 2.11/0.74 # Condensation attempts : 0
% 2.11/0.74 # Condensation successes : 0
% 2.11/0.74 # Termbank termtop insertions : 340205
% 2.11/0.74 # Search garbage collected termcells : 2
% 2.11/0.74
% 2.11/0.74 # -------------------------------------------------
% 2.11/0.74 # User time : 0.215 s
% 2.11/0.74 # System time : 0.013 s
% 2.11/0.74 # Total time : 0.228 s
% 2.11/0.74 # Maximum resident set size: 1616 pages
% 2.11/0.74
% 2.11/0.74 # -------------------------------------------------
% 2.11/0.74 # User time : 0.216 s
% 2.11/0.74 # System time : 0.014 s
% 2.11/0.74 # Total time : 0.230 s
% 2.11/0.74 # Maximum resident set size: 1692 pages
% 2.11/0.74 % E---3.1 exiting
%------------------------------------------------------------------------------