TSTP Solution File: FLD030-3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : FLD030-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n008.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 : Mon May 20 19:52:24 EDT 2024

% Result   : Unsatisfiable 0.21s 0.57s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  11 unt;   0 nHn;  26 RR)
%            Number of literals    :   53 (   0 equ;  30 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_2) ).

cnf(existence_of_identity_multiplication,axiom,
    ( product(multiplicative_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_multiplication) ).

cnf(commutativity_multiplication,axiom,
    ( product(X1,X2,X3)
    | ~ product(X2,X1,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).

cnf(product_4,negated_conjecture,
    product(multiplicative_identity,a,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_4) ).

cnf(totality_of_multiplication,axiom,
    ( product(X1,X2,multiply(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_multiplication) ).

cnf(not_product_5,negated_conjecture,
    ~ product(d,b,multiply(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_product_5) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).

cnf(c_0_8,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_9,plain,
    ( product(multiplicative_identity,X1,X1)
    | ~ defined(X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).

cnf(c_0_10,plain,
    ( product(X1,X2,X3)
    | ~ product(X2,X1,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).

cnf(c_0_11,plain,
    ( product(X1,X2,X3)
    | ~ product(X4,X5,X1)
    | ~ product(X5,X2,X6)
    | ~ product(X4,X6,X3) ),
    c_0_8 ).

cnf(c_0_12,plain,
    ( product(multiplicative_identity,X1,X1)
    | ~ defined(X1) ),
    c_0_9 ).

cnf(c_0_13,plain,
    ( product(X1,X2,X3)
    | ~ product(X2,X1,X3) ),
    c_0_10 ).

cnf(c_0_14,negated_conjecture,
    product(multiplicative_identity,a,d),
    product_4 ).

cnf(c_0_15,plain,
    ( product(X1,X2,X3)
    | ~ product(X4,multiplicative_identity,X1)
    | ~ product(X4,X2,X3)
    | ~ defined(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    product(a,multiplicative_identity,d),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    ( product(X1,X2,multiply(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    inference(fof_simplification,[status(thm)],[totality_of_multiplication]) ).

cnf(c_0_18,negated_conjecture,
    ~ product(d,b,multiply(a,b)),
    inference(fof_simplification,[status(thm)],[not_product_5]) ).

cnf(c_0_19,negated_conjecture,
    ( product(d,X1,X2)
    | ~ product(a,X1,X2)
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    ( product(X1,X2,multiply(X1,X2))
    | ~ defined(X1)
    | ~ defined(X2) ),
    c_0_17 ).

cnf(c_0_21,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_22,negated_conjecture,
    ~ product(d,b,multiply(a,b)),
    c_0_18 ).

cnf(c_0_23,negated_conjecture,
    ( product(d,X1,multiply(a,X1))
    | ~ defined(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_24,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : FLD030-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n008.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   : Sat May 18 21:49:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.50  Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.57  # Version: 3.1.0
% 0.21/0.57  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.57  # Starting sh5l with 300s (1) cores
% 0.21/0.57  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13502 completed with status 0
% 0.21/0.57  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.57  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.57  # No SInE strategy applied
% 0.21/0.57  # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/0.57  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57  # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 0.21/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.57  # Starting new_bool_3 with 269s (1) cores
% 0.21/0.57  # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.21/0.57  # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.21/0.57  # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 13506 completed with status 0
% 0.21/0.57  # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.21/0.57  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.57  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.57  # No SInE strategy applied
% 0.21/0.57  # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/0.57  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.57  # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 0.21/0.57  # Preprocessing time       : 0.001 s
% 0.21/0.57  
% 0.21/0.57  # Proof found!
% 0.21/0.57  # SZS status Unsatisfiable
% 0.21/0.57  # SZS output start CNFRefutation
% See solution above
% 0.21/0.57  # Parsed axioms                        : 31
% 0.21/0.57  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.57  # Initial clauses                      : 31
% 0.21/0.57  # Removed in clause preprocessing      : 0
% 0.21/0.57  # Initial clauses in saturation        : 31
% 0.21/0.57  # Processed clauses                    : 676
% 0.21/0.57  # ...of these trivial                  : 23
% 0.21/0.57  # ...subsumed                          : 236
% 0.21/0.57  # ...remaining for further processing  : 417
% 0.21/0.57  # Other redundant clauses eliminated   : 0
% 0.21/0.57  # Clauses deleted for lack of memory   : 0
% 0.21/0.57  # Backward-subsumed                    : 0
% 0.21/0.57  # Backward-rewritten                   : 4
% 0.21/0.57  # Generated clauses                    : 3024
% 0.21/0.57  # ...of the previous two non-redundant : 2278
% 0.21/0.57  # ...aggressively subsumed             : 0
% 0.21/0.57  # Contextual simplify-reflections      : 0
% 0.21/0.57  # Paramodulations                      : 3022
% 0.21/0.57  # Factorizations                       : 2
% 0.21/0.57  # NegExts                              : 0
% 0.21/0.57  # Equation resolutions                 : 0
% 0.21/0.57  # Disequality decompositions           : 0
% 0.21/0.57  # Total rewrite steps                  : 2050
% 0.21/0.57  # ...of those cached                   : 1981
% 0.21/0.57  # Propositional unsat checks           : 0
% 0.21/0.57  #    Propositional check models        : 0
% 0.21/0.57  #    Propositional check unsatisfiable : 0
% 0.21/0.57  #    Propositional clauses             : 0
% 0.21/0.57  #    Propositional clauses after purity: 0
% 0.21/0.57  #    Propositional unsat core size     : 0
% 0.21/0.57  #    Propositional preprocessing time  : 0.000
% 0.21/0.57  #    Propositional encoding time       : 0.000
% 0.21/0.57  #    Propositional solver time         : 0.000
% 0.21/0.57  #    Success case prop preproc time    : 0.000
% 0.21/0.57  #    Success case prop encoding time   : 0.000
% 0.21/0.57  #    Success case prop solver time     : 0.000
% 0.21/0.57  # Current number of processed clauses  : 413
% 0.21/0.57  #    Positive orientable unit clauses  : 69
% 0.21/0.57  #    Positive unorientable unit clauses: 0
% 0.21/0.57  #    Negative unit clauses             : 2
% 0.21/0.57  #    Non-unit-clauses                  : 342
% 0.21/0.57  # Current number of unprocessed clauses: 1586
% 0.21/0.57  # ...number of literals in the above   : 4411
% 0.21/0.57  # Current number of archived formulas  : 0
% 0.21/0.57  # Current number of archived clauses   : 4
% 0.21/0.57  # Clause-clause subsumption calls (NU) : 42660
% 0.21/0.57  # Rec. Clause-clause subsumption calls : 37415
% 0.21/0.57  # Non-unit clause-clause subsumptions  : 236
% 0.21/0.57  # Unit Clause-clause subsumption calls : 467
% 0.21/0.57  # Rewrite failures with RHS unbound    : 0
% 0.21/0.57  # BW rewrite match attempts            : 118
% 0.21/0.57  # BW rewrite match successes           : 4
% 0.21/0.57  # Condensation attempts                : 0
% 0.21/0.57  # Condensation successes               : 0
% 0.21/0.57  # Termbank termtop insertions          : 42800
% 0.21/0.57  # Search garbage collected termcells   : 116
% 0.21/0.57  
% 0.21/0.57  # -------------------------------------------------
% 0.21/0.57  # User time                : 0.055 s
% 0.21/0.57  # System time              : 0.004 s
% 0.21/0.57  # Total time               : 0.059 s
% 0.21/0.57  # Maximum resident set size: 1680 pages
% 0.21/0.57  
% 0.21/0.57  # -------------------------------------------------
% 0.21/0.57  # User time                : 0.268 s
% 0.21/0.57  # System time              : 0.023 s
% 0.21/0.57  # Total time               : 0.292 s
% 0.21/0.57  # Maximum resident set size: 1724 pages
% 0.21/0.57  % E---3.1 exiting
% 0.21/0.57  % E exiting
%------------------------------------------------------------------------------