TSTP Solution File: BOO010-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO010-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:07 EDT 2023
% Result : Unsatisfiable 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 21 unt; 0 nHn; 18 RR)
% Number of literals : 70 ( 7 equ; 36 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 91 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity8,axiom,
( sum(X6,X2,X7)
| ~ sum(X1,X2,X3)
| ~ sum(X4,X2,X5)
| ~ product(X1,X4,X6)
| ~ product(X3,X5,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',distributivity8) ).
cnf(multiplicative_identity1,axiom,
product(multiplicative_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',multiplicative_identity1) ).
cnf(multiplicative_identity2,axiom,
product(X1,multiplicative_identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',multiplicative_identity2) ).
cnf(additive_inverse1,axiom,
sum(inverse(X1),X1,multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',additive_inverse1) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',addition_is_well_defined) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',closure_of_addition) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',commutativity_of_addition) ).
cnf(distributivity1,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',distributivity1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',closure_of_multiplication) ).
cnf(prove_equations,negated_conjecture,
~ sum(x,multiply(x,y),x),
file('/export/starexec/sandbox2/tmp/tmp.MFIM5hJCVq/E---3.1_19807.p',prove_equations) ).
cnf(c_0_10,axiom,
( sum(X6,X2,X7)
| ~ sum(X1,X2,X3)
| ~ sum(X4,X2,X5)
| ~ product(X1,X4,X6)
| ~ product(X3,X5,X7) ),
distributivity8 ).
cnf(c_0_11,axiom,
product(multiplicative_identity,X1,X1),
multiplicative_identity1 ).
cnf(c_0_12,plain,
( sum(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ sum(X4,X2,multiplicative_identity)
| ~ sum(X5,X2,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
product(X1,multiplicative_identity,X1),
multiplicative_identity2 ).
cnf(c_0_14,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X2,multiplicative_identity)
| ~ sum(multiplicative_identity,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
sum(inverse(X1),X1,multiplicative_identity),
additive_inverse1 ).
cnf(c_0_16,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_17,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_18,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_19,plain,
( sum(inverse(X1),X1,X2)
| ~ sum(multiplicative_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( X1 = add(X2,X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
( X1 = multiplicative_identity
| ~ sum(inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_23,plain,
sum(inverse(X1),X1,add(multiplicative_identity,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
add(X1,inverse(X1)) = multiplicative_identity,
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
distributivity1 ).
cnf(c_0_27,plain,
add(multiplicative_identity,X1) = multiplicative_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_28,plain,
( sum(X1,X2,X3)
| ~ product(X3,X4,X2)
| ~ product(X3,X5,X1)
| ~ sum(X5,X4,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_29,plain,
sum(X1,multiplicative_identity,multiplicative_identity),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_30,plain,
( sum(X1,X2,X2)
| ~ product(X2,X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_13]),c_0_29])]) ).
cnf(c_0_31,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_32,plain,
sum(multiply(X1,X2),X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ sum(x,multiply(x,y),x),
prove_equations ).
cnf(c_0_34,plain,
sum(X1,multiply(X1,X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : BOO010-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n025.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 2400
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon Oct 2 20:47:22 EDT 2023
% 0.17/0.38 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.50 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.MFIM5hJCVq/E---3.1_19807.p
% 0.22/0.52 # Version: 3.1pre001
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19919 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52 # Starting sh5l with 136s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19923 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Unsatisfiable
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 23
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 23
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 23
% 0.22/0.52 # Processed clauses : 211
% 0.22/0.52 # ...of these trivial : 20
% 0.22/0.52 # ...subsumed : 53
% 0.22/0.52 # ...remaining for further processing : 138
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 7
% 0.22/0.52 # Backward-rewritten : 8
% 0.22/0.52 # Generated clauses : 603
% 0.22/0.52 # ...of the previous two non-redundant : 331
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 603
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Total rewrite steps : 352
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 100
% 0.22/0.52 # Positive orientable unit clauses : 34
% 0.22/0.52 # Positive unorientable unit clauses: 2
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 64
% 0.22/0.52 # Current number of unprocessed clauses: 151
% 0.22/0.52 # ...number of literals in the above : 465
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 38
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 1531
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 1099
% 0.22/0.52 # Non-unit clause-clause subsumptions : 58
% 0.22/0.52 # Unit Clause-clause subsumption calls : 40
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 208
% 0.22/0.52 # BW rewrite match successes : 36
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 6290
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.012 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.014 s
% 0.22/0.52 # Maximum resident set size: 1632 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.061 s
% 0.22/0.52 # System time : 0.008 s
% 0.22/0.52 # Total time : 0.069 s
% 0.22/0.52 # Maximum resident set size: 1692 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------