TSTP Solution File: BOO006-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO006-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:26 EDT 2023
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 4 RR)
% Number of literals : 24 ( 23 equ; 3 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',multiplicative_id1) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',multiplicative_id2) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',distributivity4) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',commutativity_of_add) ).
cnf(prove_right_identity,negated_conjecture,
multiply(a,additive_identity) != additive_identity,
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',prove_right_identity) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',commutativity_of_multiply) ).
cnf(additive_id2,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.qHYc4ik6Ho/E---3.1_17207.p',additive_id2) ).
cnf(c_0_9,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
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,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_13,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_14,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_15,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
cnf(c_0_16,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_17,negated_conjecture,
multiply(a,additive_identity) != additive_identity,
prove_right_identity ).
cnf(c_0_18,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_19,axiom,
add(additive_identity,X1) = X1,
additive_id2 ).
cnf(c_0_20,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_14,c_0_11]),c_0_15]),c_0_11]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
multiply(additive_identity,a) != additive_identity,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
multiply(additive_identity,X1) = additive_identity,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : BOO006-2 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n001.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 21:10:22 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 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.qHYc4ik6Ho/E---3.1_17207.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # new_bool_3 with pid 17293 completed with status 0
% 0.14/0.41 # Result found by new_bool_3
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.41 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17297 completed with status 0
% 0.14/0.41 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Unsatisfiable
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 15
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 15
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 15
% 0.14/0.41 # Processed clauses : 67
% 0.14/0.41 # ...of these trivial : 9
% 0.14/0.41 # ...subsumed : 11
% 0.14/0.41 # ...remaining for further processing : 47
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 0
% 0.14/0.41 # Backward-rewritten : 10
% 0.14/0.41 # Generated clauses : 238
% 0.14/0.41 # ...of the previous two non-redundant : 150
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 0
% 0.14/0.41 # Paramodulations : 238
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 247
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 24
% 0.14/0.41 # Positive orientable unit clauses : 22
% 0.14/0.41 # Positive unorientable unit clauses: 2
% 0.14/0.41 # Negative unit clauses : 0
% 0.14/0.41 # Non-unit-clauses : 0
% 0.14/0.41 # Current number of unprocessed clauses: 110
% 0.14/0.41 # ...number of literals in the above : 110
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 23
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 # Non-unit clause-clause subsumptions : 0
% 0.14/0.41 # Unit Clause-clause subsumption calls : 1
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 110
% 0.14/0.41 # BW rewrite match successes : 41
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 2054
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.004 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.005 s
% 0.14/0.41 # Maximum resident set size: 1612 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.006 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.008 s
% 0.14/0.41 # Maximum resident set size: 1672 pages
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------