TSTP Solution File: BOO009-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO009-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:27 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 39 ( 22 unt; 0 nHn; 20 RR)
% Number of literals : 75 ( 7 equ; 38 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 : 99 ( 5 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.wZF9dcZoJk/E---3.1_23419.p',distributivity4) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',additive_identity1) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',additive_identity2) ).
cnf(multiplicative_inverse1,axiom,
product(inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',multiplicative_inverse1) ).
cnf(multiplication_is_well_defined,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',multiplication_is_well_defined) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',closure_of_multiplication) ).
cnf(commutativity_of_multiplication,axiom,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',commutativity_of_multiplication) ).
cnf(distributivity7,axiom,
( product(X3,X5,X7)
| ~ sum(X1,X2,X3)
| ~ sum(X4,X2,X5)
| ~ product(X1,X4,X6)
| ~ sum(X6,X2,X7) ),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',distributivity7) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',commutativity_of_addition) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',closure_of_addition) ).
cnf(prove_equations,negated_conjecture,
~ product(x,add(x,y),x),
file('/export/starexec/sandbox/tmp/tmp.wZF9dcZoJk/E---3.1_23419.p',prove_equations) ).
cnf(c_0_11,axiom,
( product(X6,X2,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ sum(X3,X5,X7) ),
distributivity4 ).
cnf(c_0_12,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_13,plain,
( product(X1,X2,X3)
| ~ product(X4,X2,additive_identity)
| ~ product(X5,X2,X3)
| ~ sum(X4,X5,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
sum(X1,additive_identity,X1),
additive_identity2 ).
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_13,c_0_14]) ).
cnf(c_0_16,axiom,
product(inverse(X1),X1,additive_identity),
multiplicative_inverse1 ).
cnf(c_0_17,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
multiplication_is_well_defined ).
cnf(c_0_18,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_19,axiom,
( product(X2,X1,X3)
| ~ product(X1,X2,X3) ),
commutativity_of_multiplication ).
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,axiom,
( product(X3,X5,X7)
| ~ sum(X1,X2,X3)
| ~ sum(X4,X2,X5)
| ~ product(X1,X4,X6)
| ~ sum(X6,X2,X7) ),
distributivity7 ).
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,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,additive_identity)
| ~ sum(X5,X3,X2)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_12]) ).
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,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_32,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_33,plain,
( product(X1,X2,X2)
| ~ sum(X3,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_30])]) ).
cnf(c_0_34,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
product(add(X1,X2),X1,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
~ product(x,add(x,y),x),
prove_equations ).
cnf(c_0_37,plain,
product(X1,add(X1,X2),X1),
inference(spm,[status(thm)],[c_0_19,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.00/0.12 % Problem : BOO009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 20:53:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.wZF9dcZoJk/E---3.1_23419.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23501 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 23505 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 23
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 23
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 23
% 0.20/0.52 # Processed clauses : 511
% 0.20/0.52 # ...of these trivial : 29
% 0.20/0.52 # ...subsumed : 249
% 0.20/0.52 # ...remaining for further processing : 233
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 10
% 0.20/0.52 # Backward-rewritten : 16
% 0.20/0.52 # Generated clauses : 1616
% 0.20/0.52 # ...of the previous two non-redundant : 938
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 1616
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 1251
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 184
% 0.20/0.52 # Positive orientable unit clauses : 39
% 0.20/0.52 # Positive unorientable unit clauses: 2
% 0.20/0.52 # Negative unit clauses : 0
% 0.20/0.52 # Non-unit-clauses : 143
% 0.20/0.52 # Current number of unprocessed clauses: 438
% 0.20/0.52 # ...number of literals in the above : 1288
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 49
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 7676
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 6142
% 0.20/0.52 # Non-unit clause-clause subsumptions : 245
% 0.20/0.52 # Unit Clause-clause subsumption calls : 45
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 218
% 0.20/0.52 # BW rewrite match successes : 39
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 16644
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.033 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.034 s
% 0.20/0.52 # Maximum resident set size: 1648 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.161 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.168 s
% 0.20/0.52 # Maximum resident set size: 1688 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------