TSTP Solution File: BOO017-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO017-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:12 EDT 2023
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 7 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 40 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',multiplicative_id1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',additive_id1) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',commutativity_of_multiply) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',multiplicative_id2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',commutativity_of_add) ).
cnf(x_times_y,hypothesis,
add(x,y) = z,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',x_times_y) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',distributivity4) ).
cnf(additive_id2,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',additive_id2) ).
cnf(prove_sum,negated_conjecture,
multiply(x,z) != x,
file('/export/starexec/sandbox2/tmp/tmp.JzAMz23ij4/E---3.1_15417.p',prove_sum) ).
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,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_15,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_16,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_17,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_18,plain,
multiply(X1,add(X1,X2)) = add(X1,multiply(X2,additive_identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15]) ).
cnf(c_0_19,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_20,hypothesis,
add(x,y) = z,
x_times_y ).
cnf(c_0_21,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_22,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12]) ).
cnf(c_0_23,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X2,additive_identity)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
add(y,x) = z,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,axiom,
add(additive_identity,X1) = X1,
additive_id2 ).
cnf(c_0_26,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_21,c_0_13]),c_0_22]),c_0_13]),c_0_19]) ).
cnf(c_0_27,hypothesis,
add(x,multiply(additive_identity,y)) = multiply(x,z),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).
cnf(c_0_28,plain,
multiply(additive_identity,X1) = additive_identity,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
multiply(x,z) != x,
prove_sum ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_14]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : BOO017-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n009.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 2400
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Mon Oct 2 20:32:14 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.JzAMz23ij4/E---3.1_15417.p
% 0.14/0.44 # Version: 3.1pre001
% 0.14/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # sh5l with pid 15559 completed with status 0
% 0.14/0.44 # Result found by sh5l
% 0.14/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.44 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.44 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 15566 completed with status 0
% 0.14/0.44 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 # Starting sh5l with 300s (1) cores
% 0.14/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.44 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.44 # Preprocessing time : 0.001 s
% 0.14/0.44 # Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 # Proof found!
% 0.14/0.44 # SZS status Unsatisfiable
% 0.14/0.44 # SZS output start CNFRefutation
% See solution above
% 0.14/0.44 # Parsed axioms : 16
% 0.14/0.44 # Removed by relevancy pruning/SinE : 0
% 0.14/0.44 # Initial clauses : 16
% 0.14/0.44 # Removed in clause preprocessing : 0
% 0.14/0.44 # Initial clauses in saturation : 16
% 0.14/0.44 # Processed clauses : 74
% 0.14/0.44 # ...of these trivial : 14
% 0.14/0.44 # ...subsumed : 3
% 0.14/0.44 # ...remaining for further processing : 57
% 0.14/0.44 # Other redundant clauses eliminated : 0
% 0.14/0.44 # Clauses deleted for lack of memory : 0
% 0.14/0.44 # Backward-subsumed : 0
% 0.14/0.44 # Backward-rewritten : 14
% 0.14/0.44 # Generated clauses : 281
% 0.14/0.44 # ...of the previous two non-redundant : 183
% 0.14/0.44 # ...aggressively subsumed : 0
% 0.14/0.44 # Contextual simplify-reflections : 0
% 0.14/0.44 # Paramodulations : 281
% 0.14/0.44 # Factorizations : 0
% 0.14/0.44 # NegExts : 0
% 0.14/0.44 # Equation resolutions : 0
% 0.14/0.44 # Total rewrite steps : 299
% 0.14/0.44 # Propositional unsat checks : 0
% 0.14/0.44 # Propositional check models : 0
% 0.14/0.44 # Propositional check unsatisfiable : 0
% 0.14/0.44 # Propositional clauses : 0
% 0.14/0.44 # Propositional clauses after purity: 0
% 0.14/0.44 # Propositional unsat core size : 0
% 0.14/0.44 # Propositional preprocessing time : 0.000
% 0.14/0.44 # Propositional encoding time : 0.000
% 0.14/0.44 # Propositional solver time : 0.000
% 0.14/0.44 # Success case prop preproc time : 0.000
% 0.14/0.44 # Success case prop encoding time : 0.000
% 0.14/0.44 # Success case prop solver time : 0.000
% 0.14/0.44 # Current number of processed clauses : 29
% 0.14/0.44 # Positive orientable unit clauses : 26
% 0.14/0.44 # Positive unorientable unit clauses: 2
% 0.14/0.44 # Negative unit clauses : 1
% 0.14/0.44 # Non-unit-clauses : 0
% 0.14/0.44 # Current number of unprocessed clauses: 138
% 0.14/0.44 # ...number of literals in the above : 138
% 0.14/0.44 # Current number of archived formulas : 0
% 0.14/0.44 # Current number of archived clauses : 28
% 0.14/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.44 # Non-unit clause-clause subsumptions : 0
% 0.14/0.44 # Unit Clause-clause subsumption calls : 0
% 0.14/0.44 # Rewrite failures with RHS unbound : 0
% 0.14/0.44 # BW rewrite match attempts : 119
% 0.14/0.44 # BW rewrite match successes : 49
% 0.14/0.44 # Condensation attempts : 0
% 0.14/0.44 # Condensation successes : 0
% 0.14/0.44 # Termbank termtop insertions : 2589
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.004 s
% 0.14/0.44 # System time : 0.004 s
% 0.14/0.44 # Total time : 0.008 s
% 0.14/0.44 # Maximum resident set size: 1600 pages
% 0.14/0.44
% 0.14/0.44 # -------------------------------------------------
% 0.14/0.44 # User time : 0.004 s
% 0.14/0.44 # System time : 0.007 s
% 0.14/0.44 # Total time : 0.011 s
% 0.14/0.44 # Maximum resident set size: 1676 pages
% 0.14/0.44 % E---3.1 exiting
% 0.14/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------