TSTP Solution File: BOO013-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO013-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:09 EDT 2023
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 29 unt; 0 nHn; 36 RR)
% Number of literals : 79 ( 12 equ; 34 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 80 ( 0 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.yqDRPh8BLh/E---3.1_26674.p',distributivity1) ).
cnf(multiplicative_identity2,axiom,
product(X1,multiplicative_identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',multiplicative_identity2) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',commutativity_of_addition) ).
cnf(sum_to_multiplicative_identity2,negated_conjecture,
sum(x,z,multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',sum_to_multiplicative_identity2) ).
cnf(commutativity_of_multiplication,axiom,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',commutativity_of_multiplication) ).
cnf(product_to_additive_identity1,negated_conjecture,
product(x,y,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',product_to_additive_identity1) ).
cnf(sum_to_multiplicative_identity1,negated_conjecture,
sum(x,y,multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',sum_to_multiplicative_identity1) ).
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',addition_is_well_defined) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',additive_identity2) ).
cnf(product_to_additive_identity2,negated_conjecture,
product(x,z,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',product_to_additive_identity2) ).
cnf(multiplication_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',multiplication_is_well_defined) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',closure_of_multiplication) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',closure_of_addition) ).
cnf(prove_both_inverse_are_equal,negated_conjecture,
y != z,
file('/export/starexec/sandbox2/tmp/tmp.yqDRPh8BLh/E---3.1_26674.p',prove_both_inverse_are_equal) ).
cnf(c_0_14,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_15,axiom,
product(X1,multiplicative_identity,X1),
multiplicative_identity2 ).
cnf(c_0_16,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_17,negated_conjecture,
sum(x,z,multiplicative_identity),
sum_to_multiplicative_identity2 ).
cnf(c_0_18,plain,
( sum(X1,X2,X3)
| ~ product(X3,X4,X2)
| ~ product(X3,X5,X1)
| ~ sum(X5,X4,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
sum(z,x,multiplicative_identity),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
commutativity_of_multiplication ).
cnf(c_0_21,negated_conjecture,
product(x,y,additive_identity),
product_to_additive_identity1 ).
cnf(c_0_22,negated_conjecture,
sum(x,y,multiplicative_identity),
sum_to_multiplicative_identity1 ).
cnf(c_0_23,negated_conjecture,
( sum(X1,X2,X3)
| ~ product(X3,x,X2)
| ~ product(X3,z,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
product(y,x,additive_identity),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_26,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
cnf(c_0_27,negated_conjecture,
sum(y,x,multiplicative_identity),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
product(x,z,additive_identity),
product_to_additive_identity2 ).
cnf(c_0_29,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
multiplication_is_well_defined ).
cnf(c_0_30,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_31,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_32,negated_conjecture,
( sum(X1,additive_identity,y)
| ~ product(y,z,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( sum(X1,X2,X3)
| ~ product(X3,x,X2)
| ~ product(X3,y,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
product(z,x,additive_identity),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_36,plain,
( X1 = multiply(X2,X3)
| ~ product(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
product(X1,X2,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_38,plain,
( X1 = add(X2,X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
sum(multiply(y,z),additive_identity,y),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_40,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
( sum(X1,additive_identity,z)
| ~ product(z,y,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
multiply(y,z) = y,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
sum(y,additive_identity,z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
y != z,
prove_both_inverse_are_equal ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_44]),c_0_40]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : BOO013-3 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n015.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 20:59:01 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.18/0.43 Running first-order theorem proving
% 0.18/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.yqDRPh8BLh/E---3.1_26674.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26762 completed with status 0
% 0.18/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: FHUSM-FFMS21-SFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.46 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.46 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.46 # Starting sh5l with 136s (1) cores
% 0.18/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26769 completed with status 0
% 0.18/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46 # No SInE strategy applied
% 0.18/0.46 # Search class: FHUSM-FFMS21-SFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.46 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.18/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Unsatisfiable
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 28
% 0.18/0.46 # Removed by relevancy pruning/SinE : 0
% 0.18/0.46 # Initial clauses : 28
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 28
% 0.18/0.46 # Processed clauses : 383
% 0.18/0.46 # ...of these trivial : 37
% 0.18/0.46 # ...subsumed : 112
% 0.18/0.46 # ...remaining for further processing : 234
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 1
% 0.18/0.46 # Backward-rewritten : 10
% 0.18/0.46 # Generated clauses : 916
% 0.18/0.46 # ...of the previous two non-redundant : 709
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 916
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Total rewrite steps : 356
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 195
% 0.18/0.46 # Positive orientable unit clauses : 47
% 0.18/0.46 # Positive unorientable unit clauses: 2
% 0.18/0.46 # Negative unit clauses : 1
% 0.18/0.46 # Non-unit-clauses : 145
% 0.18/0.46 # Current number of unprocessed clauses: 364
% 0.18/0.46 # ...number of literals in the above : 1183
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 39
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 3666
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 3019
% 0.18/0.46 # Non-unit clause-clause subsumptions : 111
% 0.18/0.46 # Unit Clause-clause subsumption calls : 2
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 159
% 0.18/0.46 # BW rewrite match successes : 48
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 10668
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.018 s
% 0.18/0.46 # System time : 0.004 s
% 0.18/0.46 # Total time : 0.021 s
% 0.18/0.46 # Maximum resident set size: 1636 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.098 s
% 0.18/0.46 # System time : 0.007 s
% 0.18/0.46 # Total time : 0.105 s
% 0.18/0.46 # Maximum resident set size: 1692 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------