TSTP Solution File: FLD035-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD035-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:30:04 EDT 2023
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 43 ( 21 unt; 2 nHn; 43 RR)
% Number of literals : 86 ( 0 equ; 45 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',existence_of_identity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',b_is_defined) ).
cnf(distributivity_2,axiom,
( product(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ product(X4,X2,X6)
| ~ product(X5,X2,X7)
| ~ sum(X6,X7,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',distributivity_2) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',commutativity_multiplication) ).
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',existence_of_identity_multiplication) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',well_definedness_of_additive_identity) ).
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.kYwte6airm/E---3.1_19031.p',associativity_multiplication_1) ).
cnf(product_6,negated_conjecture,
product(b,c,u),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',product_6) ).
cnf(product_5,negated_conjecture,
product(a,c,u),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',product_5) ).
cnf(associativity_multiplication_2,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',associativity_multiplication_2) ).
cnf(existence_of_inverse_multiplication,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',existence_of_inverse_multiplication) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',c_is_defined) ).
cnf(not_sum_7,negated_conjecture,
~ sum(additive_identity,c,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',not_sum_7) ).
cnf(not_product_8,negated_conjecture,
~ product(multiplicative_identity,a,b),
file('/export/starexec/sandbox2/tmp/tmp.kYwte6airm/E---3.1_19031.p',not_product_8) ).
cnf(c_0_14,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_15,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_16,axiom,
( product(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ product(X4,X2,X6)
| ~ product(X5,X2,X7)
| ~ sum(X6,X7,X3) ),
distributivity_2 ).
cnf(c_0_17,hypothesis,
sum(additive_identity,b,b),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_19,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_20,hypothesis,
( product(X1,X2,b)
| ~ product(X3,X2,b)
| ~ product(X4,X2,additive_identity)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( product(X1,multiplicative_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
( product(X1,multiplicative_identity,b)
| ~ product(X2,multiplicative_identity,additive_identity)
| ~ sum(X2,b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]) ).
cnf(c_0_23,hypothesis,
( product(b,multiplicative_identity,b)
| ~ product(additive_identity,multiplicative_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_24,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_25,hypothesis,
product(b,multiplicative_identity,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_24])]) ).
cnf(c_0_26,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_27,hypothesis,
product(multiplicative_identity,b,b),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
product(b,c,u),
product_6 ).
cnf(c_0_29,negated_conjecture,
product(a,c,u),
product_5 ).
cnf(c_0_30,hypothesis,
( product(X1,X2,b)
| ~ product(X3,b,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
product(c,b,u),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_32,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
associativity_multiplication_2 ).
cnf(c_0_33,negated_conjecture,
product(c,a,u),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( product(X1,u,b)
| ~ product(X1,c,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_36,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_37,negated_conjecture,
~ sum(additive_identity,c,additive_identity),
not_sum_7 ).
cnf(c_0_38,negated_conjecture,
( product(X1,a,X2)
| ~ product(X3,u,X2)
| ~ product(X3,c,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
product(multiplicative_inverse(c),u,b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( product(X1,a,b)
| ~ product(multiplicative_inverse(c),c,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
~ product(multiplicative_identity,a,b),
not_product_8 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_36])]),c_0_41]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : FLD035-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 23:01:25 EDT 2023
% 0.15/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.kYwte6airm/E---3.1_19031.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 19156 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGUNF-FFMM11-SFFFFFNN
% 0.21/0.52 # partial match(1): FGUNF-FFMM21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.21/0.52 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 19167 completed with status 0
% 0.21/0.52 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGUNF-FFMM11-SFFFFFNN
% 0.21/0.52 # partial match(1): FGUNF-FFMM21-SFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 34
% 0.21/0.52 # Removed by relevancy pruning/SinE : 4
% 0.21/0.52 # Initial clauses : 30
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 30
% 0.21/0.52 # Processed clauses : 678
% 0.21/0.52 # ...of these trivial : 10
% 0.21/0.52 # ...subsumed : 176
% 0.21/0.52 # ...remaining for further processing : 492
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 22
% 0.21/0.52 # Generated clauses : 1665
% 0.21/0.52 # ...of the previous two non-redundant : 1143
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 1657
% 0.21/0.52 # Factorizations : 8
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 914
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 470
% 0.21/0.52 # Positive orientable unit clauses : 71
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 396
% 0.21/0.52 # Current number of unprocessed clauses: 495
% 0.21/0.52 # ...number of literals in the above : 1871
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 22
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 9439
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 7371
% 0.21/0.52 # Non-unit clause-clause subsumptions : 176
% 0.21/0.52 # Unit Clause-clause subsumption calls : 208
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 44
% 0.21/0.52 # BW rewrite match successes : 17
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 22855
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.041 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.046 s
% 0.21/0.52 # Maximum resident set size: 1800 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.041 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.049 s
% 0.21/0.52 # Maximum resident set size: 1700 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------