TSTP Solution File: BOO004-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO004-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:25 EDT 2023
% Result : Unsatisfiable 0.53s 0.56s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 3 RR)
% Number of literals : 39 ( 38 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 88 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity5,axiom,
ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',distributivity5) ).
cnf(additive_inverse2,axiom,
sum(X1,inverse(X1),multiplicative_identity) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',additive_inverse2) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',ifeq_axiom_001) ).
cnf(addition_is_well_defined,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',addition_is_well_defined) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',additive_identity1) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',ifeq_axiom) ).
cnf(commutativity_of_addition,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',commutativity_of_addition) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',closure_of_addition) ).
cnf(multiplicative_inverse1,axiom,
product(inverse(X1),X1,additive_identity) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',multiplicative_inverse1) ).
cnf(multiplication_is_well_defined,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',multiplication_is_well_defined) ).
cnf(multiplicative_identity1,axiom,
product(multiplicative_identity,X1,X1) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',multiplicative_identity1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)) = true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',closure_of_multiplication) ).
cnf(prove_both_equalities,negated_conjecture,
sum(x,x,x) != true,
file('/export/starexec/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p',prove_both_equalities) ).
cnf(c_0_13,axiom,
ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true) = true,
distributivity5 ).
cnf(c_0_14,axiom,
sum(X1,inverse(X1),multiplicative_identity) = true,
additive_inverse2 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_16,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
addition_is_well_defined ).
cnf(c_0_17,axiom,
sum(additive_identity,X1,X1) = true,
additive_identity1 ).
cnf(c_0_18,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_19,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
commutativity_of_addition ).
cnf(c_0_20,axiom,
sum(X1,X2,add(X1,X2)) = true,
closure_of_addition ).
cnf(c_0_21,plain,
ifeq(product(inverse(X1),X2,X3),true,ifeq(sum(X1,X3,X4),true,ifeq(sum(X1,X2,X5),true,product(multiplicative_identity,X5,X4),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_22,axiom,
product(inverse(X1),X1,additive_identity) = true,
multiplicative_inverse1 ).
cnf(c_0_23,plain,
ifeq2(sum(additive_identity,X1,X2),true,X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,plain,
sum(X1,X2,add(X2,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15]) ).
cnf(c_0_25,plain,
ifeq(sum(X1,additive_identity,X2),true,ifeq(sum(X1,X1,X3),true,product(multiplicative_identity,X3,X2),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15]) ).
cnf(c_0_26,plain,
add(X1,additive_identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).
cnf(c_0_27,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
multiplication_is_well_defined ).
cnf(c_0_28,axiom,
product(multiplicative_identity,X1,X1) = true,
multiplicative_identity1 ).
cnf(c_0_29,axiom,
product(X1,X2,multiply(X1,X2)) = true,
closure_of_multiplication ).
cnf(c_0_30,plain,
ifeq(sum(X1,X1,X2),true,product(multiplicative_identity,X2,X1),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]),c_0_15]) ).
cnf(c_0_31,plain,
ifeq2(product(multiplicative_identity,X1,X2),true,X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_32,plain,
ifeq2(product(X1,X2,X3),true,multiply(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_18]) ).
cnf(c_0_33,plain,
product(multiplicative_identity,add(X1,X1),X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_20]),c_0_15]) ).
cnf(c_0_34,plain,
multiply(multiplicative_identity,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_18]) ).
cnf(c_0_35,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_18]) ).
cnf(c_0_36,negated_conjecture,
sum(x,x,x) != true,
prove_both_equalities ).
cnf(c_0_37,plain,
sum(X1,X1,X1) = true,
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : BOO004-10 : TPTP v8.1.2. Released v7.5.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 20:36:49 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.oL83NFSnOO/E---3.1_25822.p
% 0.53/0.56 # Version: 3.1pre001
% 0.53/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.53/0.56 # Starting sh5l with 300s (1) cores
% 0.53/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25899 completed with status 0
% 0.53/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.56 # No SInE strategy applied
% 0.53/0.56 # Search class: FUUPM-FFMF32-MFFFFFNN
% 0.53/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.56 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.53/0.56 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.56 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.56 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.53/0.56 # G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with pid 25909 completed with status 0
% 0.53/0.56 # Result found by G-E--_208_B02_F1_AE_CS_SP_PS_S0Y
% 0.53/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.56 # No SInE strategy applied
% 0.53/0.56 # Search class: FUUPM-FFMF32-MFFFFFNN
% 0.53/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.56 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 583s (1) cores
% 0.53/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.53/0.56 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.56 # Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.56 # Preprocessing time : 0.001 s
% 0.53/0.56 # Presaturation interreduction done
% 0.53/0.56
% 0.53/0.56 # Proof found!
% 0.53/0.56 # SZS status Unsatisfiable
% 0.53/0.56 # SZS output start CNFRefutation
% See solution above
% 0.53/0.56 # Parsed axioms : 25
% 0.53/0.56 # Removed by relevancy pruning/SinE : 0
% 0.53/0.56 # Initial clauses : 25
% 0.53/0.56 # Removed in clause preprocessing : 0
% 0.53/0.56 # Initial clauses in saturation : 25
% 0.53/0.56 # Processed clauses : 351
% 0.53/0.56 # ...of these trivial : 124
% 0.53/0.56 # ...subsumed : 6
% 0.53/0.56 # ...remaining for further processing : 221
% 0.53/0.56 # Other redundant clauses eliminated : 0
% 0.53/0.56 # Clauses deleted for lack of memory : 0
% 0.53/0.56 # Backward-subsumed : 0
% 0.53/0.56 # Backward-rewritten : 44
% 0.53/0.56 # Generated clauses : 3062
% 0.53/0.56 # ...of the previous two non-redundant : 1415
% 0.53/0.56 # ...aggressively subsumed : 0
% 0.53/0.56 # Contextual simplify-reflections : 0
% 0.53/0.56 # Paramodulations : 3062
% 0.53/0.56 # Factorizations : 0
% 0.53/0.56 # NegExts : 0
% 0.53/0.56 # Equation resolutions : 0
% 0.53/0.56 # Total rewrite steps : 3964
% 0.53/0.56 # Propositional unsat checks : 0
% 0.53/0.56 # Propositional check models : 0
% 0.53/0.56 # Propositional check unsatisfiable : 0
% 0.53/0.56 # Propositional clauses : 0
% 0.53/0.56 # Propositional clauses after purity: 0
% 0.53/0.56 # Propositional unsat core size : 0
% 0.53/0.56 # Propositional preprocessing time : 0.000
% 0.53/0.56 # Propositional encoding time : 0.000
% 0.53/0.56 # Propositional solver time : 0.000
% 0.53/0.56 # Success case prop preproc time : 0.000
% 0.53/0.56 # Success case prop encoding time : 0.000
% 0.53/0.56 # Success case prop solver time : 0.000
% 0.53/0.56 # Current number of processed clauses : 152
% 0.53/0.56 # Positive orientable unit clauses : 150
% 0.53/0.56 # Positive unorientable unit clauses: 2
% 0.53/0.56 # Negative unit clauses : 0
% 0.53/0.56 # Non-unit-clauses : 0
% 0.53/0.56 # Current number of unprocessed clauses: 1064
% 0.53/0.56 # ...number of literals in the above : 1064
% 0.53/0.56 # Current number of archived formulas : 0
% 0.53/0.56 # Current number of archived clauses : 69
% 0.53/0.56 # Clause-clause subsumption calls (NU) : 0
% 0.53/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.53/0.56 # Non-unit clause-clause subsumptions : 0
% 0.53/0.56 # Unit Clause-clause subsumption calls : 0
% 0.53/0.56 # Rewrite failures with RHS unbound : 0
% 0.53/0.56 # BW rewrite match attempts : 2501
% 0.53/0.56 # BW rewrite match successes : 66
% 0.53/0.56 # Condensation attempts : 0
% 0.53/0.56 # Condensation successes : 0
% 0.53/0.56 # Termbank termtop insertions : 46813
% 0.53/0.56
% 0.53/0.56 # -------------------------------------------------
% 0.53/0.56 # User time : 0.038 s
% 0.53/0.56 # System time : 0.004 s
% 0.53/0.56 # Total time : 0.042 s
% 0.53/0.56 # Maximum resident set size: 1552 pages
% 0.53/0.56
% 0.53/0.56 # -------------------------------------------------
% 0.53/0.56 # User time : 0.163 s
% 0.53/0.56 # System time : 0.017 s
% 0.53/0.56 # Total time : 0.181 s
% 0.53/0.56 # Maximum resident set size: 1692 pages
% 0.53/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------