TSTP Solution File: FLD002-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD002-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:29:52 EDT 2023
% Result : Unsatisfiable 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 20 unt; 0 nHn; 36 RR)
% Number of literals : 66 ( 0 equ; 32 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',existence_of_identity_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',a_is_defined) ).
cnf(associativity_multiplication_1,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',associativity_multiplication_1) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',b_is_defined) ).
cnf(product_3,hypothesis,
product(multiplicative_identity,a,b),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',product_3) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',commutativity_multiplication) ).
cnf(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',well_definedness_of_multiplicative_identity) ).
cnf(distributivity_1,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X6)
| ~ product(X6,X7,X3)
| ~ product(X4,X7,X1)
| ~ product(X5,X7,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',distributivity_1) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',well_definedness_of_additive_identity) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',existence_of_identity_addition) ).
cnf(not_sum_4,negated_conjecture,
~ sum(additive_identity,a,b),
file('/export/starexec/sandbox2/tmp/tmp.d9mzdJWDwT/E---3.1_8313.p',not_sum_4) ).
cnf(c_0_11,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_12,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_13,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_14,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_16,hypothesis,
( product(X1,X2,a)
| ~ product(X3,a,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
product(multiplicative_identity,a,b),
product_3 ).
cnf(c_0_18,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_19,hypothesis,
product(multiplicative_identity,b,b),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_20,hypothesis,
( product(X1,b,a)
| ~ product(X1,multiplicative_identity,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_22,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X6)
| ~ product(X6,X7,X3)
| ~ product(X4,X7,X1)
| ~ product(X5,X7,X2) ),
distributivity_1 ).
cnf(c_0_23,hypothesis,
product(b,multiplicative_identity,b),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
( product(b,X1,a)
| ~ product(X1,multiplicative_identity,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_25,plain,
product(multiplicative_identity,multiplicative_identity,multiplicative_identity),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_26,hypothesis,
( sum(X1,X2,b)
| ~ product(X3,multiplicative_identity,X2)
| ~ product(X4,multiplicative_identity,X1)
| ~ sum(X4,X3,b) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,hypothesis,
product(b,multiplicative_identity,a),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_29,hypothesis,
( sum(X1,a,b)
| ~ product(X2,multiplicative_identity,X1)
| ~ sum(X2,b,b) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_31,plain,
product(multiplicative_identity,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ sum(additive_identity,a,b),
not_sum_4 ).
cnf(c_0_33,hypothesis,
( sum(X1,a,b)
| ~ product(additive_identity,multiplicative_identity,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15])]) ).
cnf(c_0_34,plain,
product(additive_identity,multiplicative_identity,additive_identity),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : FLD002-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 23:18:52 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.d9mzdJWDwT/E---3.1_8313.p
% 0.18/0.47 # Version: 3.1pre001
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # new_bool_3 with pid 8392 completed with status 0
% 0.18/0.47 # Result found by new_bool_3
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # SAT001_MinMin_p005000_rr_RG with pid 8395 completed with status 0
% 0.18/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.47 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Unsatisfiable
% 0.18/0.47 # SZS output start CNFRefutation
% See solution above
% 0.18/0.47 # Parsed axioms : 30
% 0.18/0.47 # Removed by relevancy pruning/SinE : 13
% 0.18/0.47 # Initial clauses : 17
% 0.18/0.47 # Removed in clause preprocessing : 0
% 0.18/0.47 # Initial clauses in saturation : 17
% 0.18/0.47 # Processed clauses : 190
% 0.18/0.47 # ...of these trivial : 2
% 0.18/0.47 # ...subsumed : 51
% 0.18/0.47 # ...remaining for further processing : 137
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 474
% 0.18/0.47 # ...of the previous two non-redundant : 356
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 474
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Total rewrite steps : 149
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 120
% 0.18/0.47 # Positive orientable unit clauses : 18
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 2
% 0.18/0.47 # Non-unit-clauses : 100
% 0.18/0.47 # Current number of unprocessed clauses: 198
% 0.18/0.47 # ...number of literals in the above : 703
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 17
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 864
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 854
% 0.18/0.47 # Non-unit clause-clause subsumptions : 51
% 0.18/0.47 # Unit Clause-clause subsumption calls : 0
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 5
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 6229
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.008 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.012 s
% 0.18/0.47 # Maximum resident set size: 1624 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.010 s
% 0.18/0.47 # System time : 0.005 s
% 0.18/0.47 # Total time : 0.016 s
% 0.18/0.47 # Maximum resident set size: 1700 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------