TSTP Solution File: BOO006-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : BOO006-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:26:40 EDT 2024
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 61 ( 8 equ; 32 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity4,axiom,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',distributivity4) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',additive_identity1) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',additive_identity2) ).
cnf(multiplication_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',multiplication_is_well_defined) ).
cnf(commutativity_of_multiplication,axiom,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',commutativity_of_multiplication) ).
cnf(multiplicative_inverse1,axiom,
product(inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',multiplicative_inverse1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',closure_of_multiplication) ).
cnf(prove_equations,negated_conjecture,
~ product(x,additive_identity,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p',prove_equations) ).
cnf(c_0_8,plain,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
inference(fof_simplification,[status(thm)],[distributivity4]) ).
cnf(c_0_9,plain,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
c_0_8 ).
cnf(c_0_10,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_11,plain,
( product(X1,X2,X3)
| ~ product(X4,X2,additive_identity)
| ~ product(X5,X2,X3)
| ~ sum(X4,X5,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_13,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_14,plain,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_multiplication]) ).
cnf(c_0_15,plain,
( product(X1,X2,X3)
| ~ product(X1,X2,additive_identity)
| ~ product(additive_identity,X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
product(inverse(X1),X1,additive_identity),
multiplicative_inverse1 ).
cnf(c_0_17,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_13 ).
cnf(c_0_18,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_19,plain,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
c_0_14 ).
cnf(c_0_20,plain,
( product(inverse(X1),X1,X2)
| ~ product(additive_identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( X1 = multiply(X2,X3)
| ~ product(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
product(X1,X2,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( X1 = additive_identity
| ~ product(inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,plain,
product(inverse(X1),X1,multiply(additive_identity,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
multiply(X1,inverse(X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ product(x,additive_identity,additive_identity),
inference(fof_simplification,[status(thm)],[prove_equations]) ).
cnf(c_0_28,plain,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ product(x,additive_identity,additive_identity),
c_0_27 ).
cnf(c_0_30,plain,
product(X1,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : BOO006-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri May 3 12:01:54 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.xZqz0YRdVg/E---3.1_9087.p
% 0.13/0.39 # Version: 3.1.0
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9179 completed with status 0
% 0.13/0.39 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.13/0.39 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.39 # Starting new_bool_3 with 136s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 136s (1) cores
% 0.13/0.39 # Starting sh5l with 136s (1) cores
% 0.13/0.39 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 9183 completed with status 0
% 0.13/0.39 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.13/0.39 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.13/0.39 # Preprocessing time : 0.001 s
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Unsatisfiable
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 23
% 0.13/0.39 # Removed by relevancy pruning/SinE : 0
% 0.13/0.39 # Initial clauses : 23
% 0.13/0.39 # Removed in clause preprocessing : 0
% 0.13/0.39 # Initial clauses in saturation : 23
% 0.13/0.39 # Processed clauses : 126
% 0.13/0.39 # ...of these trivial : 10
% 0.13/0.39 # ...subsumed : 18
% 0.13/0.39 # ...remaining for further processing : 98
% 0.13/0.39 # Other redundant clauses eliminated : 0
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 2
% 0.13/0.39 # Backward-rewritten : 7
% 0.13/0.39 # Generated clauses : 339
% 0.13/0.39 # ...of the previous two non-redundant : 172
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 0
% 0.13/0.39 # Paramodulations : 339
% 0.13/0.39 # Factorizations : 0
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 0
% 0.13/0.39 # Disequality decompositions : 0
% 0.13/0.39 # Total rewrite steps : 231
% 0.13/0.39 # ...of those cached : 186
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 66
% 0.13/0.39 # Positive orientable unit clauses : 23
% 0.13/0.39 # Positive unorientable unit clauses: 2
% 0.13/0.39 # Negative unit clauses : 0
% 0.13/0.39 # Non-unit-clauses : 41
% 0.13/0.39 # Current number of unprocessed clauses: 83
% 0.13/0.39 # ...number of literals in the above : 253
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 32
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 586
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 413
% 0.13/0.39 # Non-unit clause-clause subsumptions : 18
% 0.13/0.39 # Unit Clause-clause subsumption calls : 0
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 83
% 0.13/0.39 # BW rewrite match successes : 33
% 0.13/0.39 # Condensation attempts : 0
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 3832
% 0.13/0.39 # Search garbage collected termcells : 68
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.005 s
% 0.13/0.39 # System time : 0.002 s
% 0.13/0.39 # Total time : 0.007 s
% 0.13/0.39 # Maximum resident set size: 1644 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.024 s
% 0.13/0.39 # System time : 0.008 s
% 0.13/0.39 # Total time : 0.032 s
% 0.13/0.39 # Maximum resident set size: 1708 pages
% 0.13/0.39 % E---3.1 exiting
% 0.13/0.39 % E exiting
%------------------------------------------------------------------------------