TSTP Solution File: BOO012-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : BOO012-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:44 EDT 2024
% Result : Unsatisfiable 6.88s 1.33s
% Output : CNFRefutation 6.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 29 unt; 0 nHn; 31 RR)
% Number of literals : 113 ( 17 equ; 60 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 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 : 145 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
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.HmnzuShmUf/E---3.1_16018.p',distributivity1) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',commutativity_of_addition) ).
cnf(multiplication_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',multiplication_is_well_defined) ).
cnf(additive_inverse1,axiom,
sum(inverse(X1),X1,multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',additive_inverse1) ).
cnf(sum_product_dual2,axiom,
( product(X1,X3,X1)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',sum_product_dual2) ).
cnf(sum_and_multiply,axiom,
sum(X1,multiply(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',sum_and_multiply) ).
cnf(multiplicative_identity1,axiom,
product(multiplicative_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',multiplicative_identity1) ).
cnf(multiplicative_inverse2,axiom,
product(X1,inverse(X1),additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',multiplicative_inverse2) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',closure_of_multiplication) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',addition_is_well_defined) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',additive_identity2) ).
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/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',distributivity4) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',closure_of_addition) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',additive_identity1) ).
cnf(prove_inverse_is_an_involution,negated_conjecture,
inverse(inverse(x)) != x,
file('/export/starexec/sandbox2/tmp/tmp.HmnzuShmUf/E---3.1_16018.p',prove_inverse_is_an_involution) ).
cnf(c_0_15,plain,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
inference(fof_simplification,[status(thm)],[distributivity1]) ).
cnf(c_0_16,plain,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).
cnf(c_0_17,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[multiplication_is_well_defined]) ).
cnf(c_0_18,plain,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
c_0_15 ).
cnf(c_0_19,axiom,
sum(inverse(X1),X1,multiplicative_identity),
additive_inverse1 ).
cnf(c_0_20,plain,
( product(X1,X3,X1)
| ~ sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[sum_product_dual2]) ).
cnf(c_0_21,plain,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
c_0_16 ).
cnf(c_0_22,axiom,
sum(X1,multiply(X1,X2),X1),
sum_and_multiply ).
cnf(c_0_23,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_17 ).
cnf(c_0_24,axiom,
product(multiplicative_identity,X1,X1),
multiplicative_identity1 ).
cnf(c_0_25,plain,
( sum(X1,X2,X3)
| ~ product(X4,inverse(X5),X1)
| ~ product(X4,multiplicative_identity,X3)
| ~ product(X4,X5,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,axiom,
product(X1,inverse(X1),additive_identity),
multiplicative_inverse2 ).
cnf(c_0_27,plain,
( product(X1,X3,X1)
| ~ sum(X1,X2,X3) ),
c_0_20 ).
cnf(c_0_28,plain,
sum(multiply(X1,X2),X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ product(multiplicative_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_31,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).
cnf(c_0_32,plain,
( sum(X1,additive_identity,X2)
| ~ product(X3,inverse(inverse(X3)),X1)
| ~ product(X3,multiplicative_identity,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
product(multiply(X1,X2),X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
multiply(multiplicative_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
c_0_31 ).
cnf(c_0_36,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_37,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_38,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_39,plain,
( sum(X1,additive_identity,X2)
| ~ product(X2,inverse(inverse(X2)),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_34]),c_0_34]) ).
cnf(c_0_40,plain,
( X1 = X2
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
c_0_37 ).
cnf(c_0_42,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_43,plain,
( X1 = add(X2,X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_38]) ).
cnf(c_0_44,plain,
sum(multiply(X1,inverse(inverse(X1))),additive_identity,X1),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
cnf(c_0_45,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_46,plain,
( product(X1,X2,X3)
| ~ product(X4,X2,additive_identity)
| ~ product(X5,X2,X3)
| ~ sum(X4,X5,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
multiply(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,plain,
( product(multiplicative_identity,X1,X2)
| ~ product(inverse(X3),X1,additive_identity)
| ~ product(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_19]) ).
cnf(c_0_49,plain,
product(X1,inverse(inverse(X1)),X1),
inference(spm,[status(thm)],[c_0_30,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
inverse(inverse(x)) != x,
inference(fof_simplification,[status(thm)],[prove_inverse_is_an_involution]) ).
cnf(c_0_51,plain,
( X1 = multiply(X2,X3)
| ~ product(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_52,plain,
product(multiplicative_identity,inverse(inverse(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_26])]) ).
cnf(c_0_53,negated_conjecture,
inverse(inverse(x)) != x,
c_0_50 ).
cnf(c_0_54,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO012-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 11:58:20 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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.HmnzuShmUf/E---3.1_16018.p
% 6.88/1.33 # Version: 3.1.0
% 6.88/1.33 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.88/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.88/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.88/1.33 # Starting new_bool_3 with 300s (1) cores
% 6.88/1.33 # Starting new_bool_1 with 300s (1) cores
% 6.88/1.33 # Starting sh5l with 300s (1) cores
% 6.88/1.33 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16110 completed with status 0
% 6.88/1.33 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.88/1.33 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.88/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.88/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.88/1.33 # No SInE strategy applied
% 6.88/1.33 # Search class: FHUSM-FFMF21-SFFFFFNN
% 6.88/1.33 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.88/1.33 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 6.88/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.88/1.33 # Starting new_bool_3 with 136s (1) cores
% 6.88/1.33 # Starting new_bool_1 with 136s (1) cores
% 6.88/1.33 # Starting sh5l with 136s (1) cores
% 6.88/1.33 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16114 completed with status 0
% 6.88/1.33 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 6.88/1.33 # Preprocessing class: FSMSSMSSSSSNFFN.
% 6.88/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.88/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.88/1.33 # No SInE strategy applied
% 6.88/1.33 # Search class: FHUSM-FFMF21-SFFFFFNN
% 6.88/1.33 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.88/1.33 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 6.88/1.33 # Preprocessing time : 0.001 s
% 6.88/1.33 # Presaturation interreduction done
% 6.88/1.33
% 6.88/1.33 # Proof found!
% 6.88/1.33 # SZS status Unsatisfiable
% 6.88/1.33 # SZS output start CNFRefutation
% See solution above
% 6.88/1.33 # Parsed axioms : 35
% 6.88/1.33 # Removed by relevancy pruning/SinE : 0
% 6.88/1.33 # Initial clauses : 35
% 6.88/1.33 # Removed in clause preprocessing : 0
% 6.88/1.33 # Initial clauses in saturation : 35
% 6.88/1.33 # Processed clauses : 11020
% 6.88/1.33 # ...of these trivial : 508
% 6.88/1.33 # ...subsumed : 9055
% 6.88/1.33 # ...remaining for further processing : 1457
% 6.88/1.33 # Other redundant clauses eliminated : 0
% 6.88/1.33 # Clauses deleted for lack of memory : 0
% 6.88/1.33 # Backward-subsumed : 34
% 6.88/1.33 # Backward-rewritten : 211
% 6.88/1.33 # Generated clauses : 60109
% 6.88/1.33 # ...of the previous two non-redundant : 44899
% 6.88/1.33 # ...aggressively subsumed : 0
% 6.88/1.33 # Contextual simplify-reflections : 0
% 6.88/1.33 # Paramodulations : 60109
% 6.88/1.33 # Factorizations : 0
% 6.88/1.33 # NegExts : 0
% 6.88/1.33 # Equation resolutions : 0
% 6.88/1.33 # Disequality decompositions : 0
% 6.88/1.33 # Total rewrite steps : 97660
% 6.88/1.33 # ...of those cached : 95772
% 6.88/1.33 # Propositional unsat checks : 0
% 6.88/1.33 # Propositional check models : 0
% 6.88/1.33 # Propositional check unsatisfiable : 0
% 6.88/1.33 # Propositional clauses : 0
% 6.88/1.33 # Propositional clauses after purity: 0
% 6.88/1.33 # Propositional unsat core size : 0
% 6.88/1.33 # Propositional preprocessing time : 0.000
% 6.88/1.33 # Propositional encoding time : 0.000
% 6.88/1.33 # Propositional solver time : 0.000
% 6.88/1.33 # Success case prop preproc time : 0.000
% 6.88/1.33 # Success case prop encoding time : 0.000
% 6.88/1.33 # Success case prop solver time : 0.000
% 6.88/1.33 # Current number of processed clauses : 1179
% 6.88/1.33 # Positive orientable unit clauses : 132
% 6.88/1.33 # Positive unorientable unit clauses: 2
% 6.88/1.33 # Negative unit clauses : 0
% 6.88/1.33 # Non-unit-clauses : 1045
% 6.88/1.33 # Current number of unprocessed clauses: 33758
% 6.88/1.33 # ...number of literals in the above : 81579
% 6.88/1.33 # Current number of archived formulas : 0
% 6.88/1.33 # Current number of archived clauses : 278
% 6.88/1.33 # Clause-clause subsumption calls (NU) : 456840
% 6.88/1.33 # Rec. Clause-clause subsumption calls : 360855
% 6.88/1.33 # Non-unit clause-clause subsumptions : 9045
% 6.88/1.33 # Unit Clause-clause subsumption calls : 5
% 6.88/1.33 # Rewrite failures with RHS unbound : 0
% 6.88/1.33 # BW rewrite match attempts : 1533
% 6.88/1.33 # BW rewrite match successes : 113
% 6.88/1.33 # Condensation attempts : 0
% 6.88/1.33 # Condensation successes : 0
% 6.88/1.33 # Termbank termtop insertions : 837678
% 6.88/1.33 # Search garbage collected termcells : 84
% 6.88/1.33
% 6.88/1.33 # -------------------------------------------------
% 6.88/1.33 # User time : 0.790 s
% 6.88/1.33 # System time : 0.017 s
% 6.88/1.33 # Total time : 0.807 s
% 6.88/1.33 # Maximum resident set size: 1668 pages
% 6.88/1.33
% 6.88/1.33 # -------------------------------------------------
% 6.88/1.33 # User time : 4.189 s
% 6.88/1.33 # System time : 0.048 s
% 6.88/1.33 # Total time : 4.237 s
% 6.88/1.33 # Maximum resident set size: 1716 pages
% 6.88/1.33 % E---3.1 exiting
% 6.88/1.33 % E exiting
%------------------------------------------------------------------------------