TSTP Solution File: FLD028-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : FLD028-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:40:28 EDT 2024
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 21 unt; 3 nHn; 50 RR)
% Number of literals : 108 ( 0 equ; 61 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 : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',existence_of_identity_addition) ).
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/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',distributivity_2) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',v_is_defined) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',commutativity_multiplication) ).
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',existence_of_identity_multiplication) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.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/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',associativity_multiplication_1) ).
cnf(associativity_multiplication_2,axiom,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',associativity_multiplication_2) ).
cnf(product_7,negated_conjecture,
product(a,v,b),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',product_7) ).
cnf(existence_of_inverse_multiplication,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',existence_of_inverse_multiplication) ).
cnf(not_sum_5,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',not_sum_5) ).
cnf(product_6,negated_conjecture,
product(a,u,b),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',product_6) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',a_is_defined) ).
cnf(not_product_8,negated_conjecture,
~ product(multiplicative_identity,u,v),
file('/export/starexec/sandbox/tmp/tmp.nLqSoaW2y3/E---3.1_4922.p',not_product_8) ).
cnf(c_0_14,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_15,plain,
( product(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ product(X4,X2,X6)
| ~ product(X5,X2,X7)
| ~ sum(X6,X7,X3) ),
inference(fof_simplification,[status(thm)],[distributivity_2]) ).
cnf(c_0_16,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
c_0_14 ).
cnf(c_0_17,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_18,plain,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_19,plain,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_20,plain,
( product(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ product(X4,X2,X6)
| ~ product(X5,X2,X7)
| ~ sum(X6,X7,X3) ),
c_0_15 ).
cnf(c_0_21,hypothesis,
sum(additive_identity,v,v),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
c_0_18 ).
cnf(c_0_23,plain,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
c_0_19 ).
cnf(c_0_24,hypothesis,
( product(X1,X2,v)
| ~ product(X3,X2,v)
| ~ product(X4,X2,additive_identity)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( product(X1,multiplicative_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,hypothesis,
( product(X1,multiplicative_identity,v)
| ~ product(X2,multiplicative_identity,additive_identity)
| ~ sum(X2,v,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17])]) ).
cnf(c_0_27,hypothesis,
( product(v,multiplicative_identity,v)
| ~ product(additive_identity,multiplicative_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_28,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_29,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_1]) ).
cnf(c_0_30,hypothesis,
product(v,multiplicative_identity,v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_28])]) ).
cnf(c_0_31,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
c_0_29 ).
cnf(c_0_32,hypothesis,
product(multiplicative_identity,v,v),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_33,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication_2]) ).
cnf(c_0_34,hypothesis,
( product(X1,X2,v)
| ~ product(X3,v,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
product(a,v,b),
product_7 ).
cnf(c_0_36,plain,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_37,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_5]) ).
cnf(c_0_38,plain,
( product(X1,X2,X3)
| ~ product(X4,X5,X1)
| ~ product(X5,X2,X6)
| ~ product(X4,X6,X3) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
product(a,u,b),
product_6 ).
cnf(c_0_40,negated_conjecture,
( product(X1,b,v)
| ~ product(X1,a,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
c_0_36 ).
cnf(c_0_42,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_43,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
c_0_37 ).
cnf(c_0_44,negated_conjecture,
( product(X1,u,X2)
| ~ product(X3,b,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
product(multiplicative_inverse(a),b,v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ product(multiplicative_identity,u,v),
inference(fof_simplification,[status(thm)],[not_product_8]) ).
cnf(c_0_47,negated_conjecture,
( product(X1,u,v)
| ~ product(multiplicative_inverse(a),a,X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ product(multiplicative_identity,u,v),
c_0_46 ).
cnf(c_0_49,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_47,c_0_41]),c_0_42])]),c_0_48]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD028-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 13:36:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 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.nLqSoaW2y3/E---3.1_4922.p
% 0.22/0.54 # Version: 3.1.0
% 0.22/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # sh5l with pid 5030 completed with status 0
% 0.22/0.54 # Result found by sh5l
% 0.22/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.54 # Search class: FGUNF-FFMM11-SFFFFFNN
% 0.22/0.54 # partial match(1): FGUNF-FFMM21-SFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.22/0.54 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 5035 completed with status 0
% 0.22/0.54 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.22/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.54 # Search class: FGUNF-FFMM11-SFFFFFNN
% 0.22/0.54 # partial match(1): FGUNF-FFMM21-SFFFFFNN
% 0.22/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.55 # Parsed axioms : 34
% 0.22/0.55 # Removed by relevancy pruning/SinE : 4
% 0.22/0.55 # Initial clauses : 30
% 0.22/0.55 # Removed in clause preprocessing : 0
% 0.22/0.55 # Initial clauses in saturation : 30
% 0.22/0.55 # Processed clauses : 552
% 0.22/0.55 # ...of these trivial : 8
% 0.22/0.55 # ...subsumed : 132
% 0.22/0.55 # ...remaining for further processing : 412
% 0.22/0.55 # Other redundant clauses eliminated : 0
% 0.22/0.55 # Clauses deleted for lack of memory : 0
% 0.22/0.55 # Backward-subsumed : 0
% 0.22/0.55 # Backward-rewritten : 21
% 0.22/0.55 # Generated clauses : 1393
% 0.22/0.55 # ...of the previous two non-redundant : 934
% 0.22/0.55 # ...aggressively subsumed : 0
% 0.22/0.55 # Contextual simplify-reflections : 0
% 0.22/0.55 # Paramodulations : 1391
% 0.22/0.55 # Factorizations : 2
% 0.22/0.55 # NegExts : 0
% 0.22/0.55 # Equation resolutions : 0
% 0.22/0.55 # Disequality decompositions : 0
% 0.22/0.55 # Total rewrite steps : 782
% 0.22/0.55 # ...of those cached : 719
% 0.22/0.55 # Propositional unsat checks : 0
% 0.22/0.55 # Propositional check models : 0
% 0.22/0.55 # Propositional check unsatisfiable : 0
% 0.22/0.55 # Propositional clauses : 0
% 0.22/0.55 # Propositional clauses after purity: 0
% 0.22/0.55 # Propositional unsat core size : 0
% 0.22/0.55 # Propositional preprocessing time : 0.000
% 0.22/0.55 # Propositional encoding time : 0.000
% 0.22/0.55 # Propositional solver time : 0.000
% 0.22/0.55 # Success case prop preproc time : 0.000
% 0.22/0.55 # Success case prop encoding time : 0.000
% 0.22/0.55 # Success case prop solver time : 0.000
% 0.22/0.55 # Current number of processed clauses : 391
% 0.22/0.55 # Positive orientable unit clauses : 69
% 0.22/0.55 # Positive unorientable unit clauses: 0
% 0.22/0.55 # Negative unit clauses : 3
% 0.22/0.55 # Non-unit-clauses : 319
% 0.22/0.55 # Current number of unprocessed clauses: 412
% 0.22/0.55 # ...number of literals in the above : 1391
% 0.22/0.55 # Current number of archived formulas : 0
% 0.22/0.55 # Current number of archived clauses : 21
% 0.22/0.55 # Clause-clause subsumption calls (NU) : 4181
% 0.22/0.55 # Rec. Clause-clause subsumption calls : 3387
% 0.22/0.55 # Non-unit clause-clause subsumptions : 132
% 0.22/0.55 # Unit Clause-clause subsumption calls : 137
% 0.22/0.55 # Rewrite failures with RHS unbound : 0
% 0.22/0.55 # BW rewrite match attempts : 41
% 0.22/0.55 # BW rewrite match successes : 16
% 0.22/0.55 # Condensation attempts : 0
% 0.22/0.55 # Condensation successes : 0
% 0.22/0.55 # Termbank termtop insertions : 19147
% 0.22/0.55 # Search garbage collected termcells : 128
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.037 s
% 0.22/0.55 # System time : 0.003 s
% 0.22/0.55 # Total time : 0.039 s
% 0.22/0.55 # Maximum resident set size: 1772 pages
% 0.22/0.55
% 0.22/0.55 # -------------------------------------------------
% 0.22/0.55 # User time : 0.039 s
% 0.22/0.55 # System time : 0.004 s
% 0.22/0.55 # Total time : 0.043 s
% 0.22/0.55 # Maximum resident set size: 1720 pages
% 0.22/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------