TSTP Solution File: BOO013-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO013-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:09 EDT 2023
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 12 RR)
% Number of literals : 22 ( 21 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',distributivity1) ).
cnf(c_and_multiplicative_identity,hypothesis,
add(a,c) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',c_and_multiplicative_identity) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',multiplicative_id2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',commutativity_of_add) ).
cnf(b_and_multiplicative_identity,hypothesis,
add(a,b) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',b_and_multiplicative_identity) ).
cnf(b_a_additive_identity,hypothesis,
multiply(a,b) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',b_a_additive_identity) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',additive_id1) ).
cnf(c_a_additive_identity,hypothesis,
multiply(a,c) = additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',c_a_additive_identity) ).
cnf(prove_b_is_a,negated_conjecture,
b != c,
file('/export/starexec/sandbox2/tmp/tmp.ma4Gm0MXde/E---3.1_6518.p',prove_b_is_a) ).
cnf(c_0_9,axiom,
add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
distributivity1 ).
cnf(c_0_10,hypothesis,
add(a,c) = multiplicative_identity,
c_and_multiplicative_identity ).
cnf(c_0_11,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_12,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_13,hypothesis,
add(a,b) = multiplicative_identity,
b_and_multiplicative_identity ).
cnf(c_0_14,hypothesis,
add(c,multiply(a,X1)) = add(X1,c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).
cnf(c_0_15,hypothesis,
multiply(a,b) = additive_identity,
b_a_additive_identity ).
cnf(c_0_16,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_17,hypothesis,
add(b,multiply(a,X1)) = add(X1,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_11]),c_0_12]) ).
cnf(c_0_18,hypothesis,
multiply(a,c) = additive_identity,
c_a_additive_identity ).
cnf(c_0_19,hypothesis,
add(b,c) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
b != c,
prove_b_is_a ).
cnf(c_0_21,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]),c_0_12]),c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : BOO013-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 20:30:58 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.ma4Gm0MXde/E---3.1_6518.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 6672 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FUUPM-FFSS21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 6677 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FUUPM-FFSS21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 19
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 19
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 19
% 0.21/0.50 # Processed clauses : 57
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 1
% 0.21/0.50 # ...remaining for further processing : 55
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 2
% 0.21/0.50 # Generated clauses : 204
% 0.21/0.50 # ...of the previous two non-redundant : 158
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 204
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 145
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 36
% 0.21/0.50 # Positive orientable unit clauses : 33
% 0.21/0.50 # Positive unorientable unit clauses: 2
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 137
% 0.21/0.50 # ...number of literals in the above : 137
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 19
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 48
% 0.21/0.50 # BW rewrite match successes : 44
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1998
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1620 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.008 s
% 0.21/0.50 # Total time : 0.010 s
% 0.21/0.50 # Maximum resident set size: 1676 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------