TSTP Solution File: FLD025-5 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : FLD025-5 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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:32 EDT 2023

% Result   : Unsatisfiable 0.17s 0.45s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (  16 unt;   0 nHn;  28 RR)
%            Number of literals    :   50 (   0 equ;  24 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   40 (   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/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',associativity_multiplication_2) ).

cnf(product_9,negated_conjecture,
    product(a,c,u),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',product_9) ).

cnf(existence_of_identity_multiplication,axiom,
    ( product(multiplicative_identity,X1,X1)
    | ~ defined(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',existence_of_identity_multiplication) ).

cnf(u_is_defined,hypothesis,
    defined(u),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',u_is_defined) ).

cnf(product_7,negated_conjecture,
    product(multiplicative_identity,a,b),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',product_7) ).

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.6NV5QPzomu/E---3.1_27971.p',associativity_multiplication_1) ).

cnf(product_10,negated_conjecture,
    product(d,b,v),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',product_10) ).

cnf(commutativity_multiplication,axiom,
    ( product(X1,X2,X3)
    | ~ product(X2,X1,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',commutativity_multiplication) ).

cnf(product_8,negated_conjecture,
    product(multiplicative_identity,c,d),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',product_8) ).

cnf(not_product_11,negated_conjecture,
    ~ product(multiplicative_identity,u,v),
    file('/export/starexec/sandbox/tmp/tmp.6NV5QPzomu/E---3.1_27971.p',not_product_11) ).

cnf(c_0_10,axiom,
    ( product(X1,X2,X3)
    | ~ product(X4,X5,X1)
    | ~ product(X5,X2,X6)
    | ~ product(X4,X6,X3) ),
    associativity_multiplication_2 ).

cnf(c_0_11,negated_conjecture,
    product(a,c,u),
    product_9 ).

cnf(c_0_12,axiom,
    ( product(multiplicative_identity,X1,X1)
    | ~ defined(X1) ),
    existence_of_identity_multiplication ).

cnf(c_0_13,hypothesis,
    defined(u),
    u_is_defined ).

cnf(c_0_14,negated_conjecture,
    ( product(X1,c,X2)
    | ~ product(X3,u,X2)
    | ~ product(X3,a,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,hypothesis,
    product(multiplicative_identity,u,u),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,hypothesis,
    ( product(X1,c,u)
    | ~ product(multiplicative_identity,a,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    product(multiplicative_identity,a,b),
    product_7 ).

cnf(c_0_18,axiom,
    ( product(X1,X2,X3)
    | ~ product(X1,X4,X5)
    | ~ product(X4,X6,X2)
    | ~ product(X5,X6,X3) ),
    associativity_multiplication_1 ).

cnf(c_0_19,negated_conjecture,
    product(d,b,v),
    product_10 ).

cnf(c_0_20,axiom,
    ( product(X1,X2,X3)
    | ~ product(X2,X1,X3) ),
    commutativity_multiplication ).

cnf(c_0_21,negated_conjecture,
    product(b,c,u),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( product(X1,X2,v)
    | ~ product(X3,b,X2)
    | ~ product(X1,X3,d) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    product(c,b,u),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( product(X1,u,v)
    | ~ product(X1,c,d) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    product(multiplicative_identity,c,d),
    product_8 ).

cnf(c_0_26,negated_conjecture,
    ~ product(multiplicative_identity,u,v),
    not_product_11 ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : FLD025-5 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n011.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 23:02:53 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  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.6NV5QPzomu/E---3.1_27971.p
% 0.17/0.45  # Version: 3.1pre001
% 0.17/0.45  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45  # Starting sh5l with 300s (1) cores
% 0.17/0.45  # sh5l with pid 28051 completed with status 0
% 0.17/0.45  # Result found by sh5l
% 0.17/0.45  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45  # Starting sh5l with 300s (1) cores
% 0.17/0.45  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.45  # Search class: FGUNF-FFMM11-SFFFFFNN
% 0.17/0.45  # partial match(1): FGUNF-FFMM21-SFFFFFNN
% 0.17/0.45  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45  # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.17/0.45  # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 28058 completed with status 0
% 0.17/0.45  # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.17/0.45  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45  # Starting sh5l with 300s (1) cores
% 0.17/0.45  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.45  # Search class: FGUNF-FFMM11-SFFFFFNN
% 0.17/0.45  # partial match(1): FGUNF-FFMM21-SFFFFFNN
% 0.17/0.45  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45  # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.17/0.45  # Preprocessing time       : 0.001 s
% 0.17/0.45  
% 0.17/0.45  # Proof found!
% 0.17/0.45  # SZS status Unsatisfiable
% 0.17/0.45  # SZS output start CNFRefutation
% See solution above
% 0.17/0.45  # Parsed axioms                        : 37
% 0.17/0.45  # Removed by relevancy pruning/SinE    : 4
% 0.17/0.45  # Initial clauses                      : 33
% 0.17/0.45  # Removed in clause preprocessing      : 0
% 0.17/0.45  # Initial clauses in saturation        : 33
% 0.17/0.45  # Processed clauses                    : 92
% 0.17/0.45  # ...of these trivial                  : 0
% 0.17/0.45  # ...subsumed                          : 3
% 0.17/0.45  # ...remaining for further processing  : 89
% 0.17/0.45  # Other redundant clauses eliminated   : 0
% 0.17/0.45  # Clauses deleted for lack of memory   : 0
% 0.17/0.45  # Backward-subsumed                    : 0
% 0.17/0.45  # Backward-rewritten                   : 0
% 0.17/0.45  # Generated clauses                    : 228
% 0.17/0.45  # ...of the previous two non-redundant : 190
% 0.17/0.45  # ...aggressively subsumed             : 0
% 0.17/0.45  # Contextual simplify-reflections      : 0
% 0.17/0.45  # Paramodulations                      : 226
% 0.17/0.45  # Factorizations                       : 2
% 0.17/0.45  # NegExts                              : 0
% 0.17/0.45  # Equation resolutions                 : 0
% 0.17/0.45  # Total rewrite steps                  : 52
% 0.17/0.45  # Propositional unsat checks           : 0
% 0.17/0.45  #    Propositional check models        : 0
% 0.17/0.45  #    Propositional check unsatisfiable : 0
% 0.17/0.45  #    Propositional clauses             : 0
% 0.17/0.45  #    Propositional clauses after purity: 0
% 0.17/0.45  #    Propositional unsat core size     : 0
% 0.17/0.45  #    Propositional preprocessing time  : 0.000
% 0.17/0.45  #    Propositional encoding time       : 0.000
% 0.17/0.45  #    Propositional solver time         : 0.000
% 0.17/0.45  #    Success case prop preproc time    : 0.000
% 0.17/0.45  #    Success case prop encoding time   : 0.000
% 0.17/0.45  #    Success case prop solver time     : 0.000
% 0.17/0.45  # Current number of processed clauses  : 89
% 0.17/0.45  #    Positive orientable unit clauses  : 37
% 0.17/0.45  #    Positive unorientable unit clauses: 0
% 0.17/0.45  #    Negative unit clauses             : 2
% 0.17/0.45  #    Non-unit-clauses                  : 50
% 0.17/0.45  # Current number of unprocessed clauses: 131
% 0.17/0.45  # ...number of literals in the above   : 457
% 0.17/0.45  # Current number of archived formulas  : 0
% 0.17/0.45  # Current number of archived clauses   : 0
% 0.17/0.45  # Clause-clause subsumption calls (NU) : 456
% 0.17/0.45  # Rec. Clause-clause subsumption calls : 391
% 0.17/0.45  # Non-unit clause-clause subsumptions  : 3
% 0.17/0.45  # Unit Clause-clause subsumption calls : 23
% 0.17/0.45  # Rewrite failures with RHS unbound    : 0
% 0.17/0.45  # BW rewrite match attempts            : 7
% 0.17/0.45  # BW rewrite match successes           : 0
% 0.17/0.45  # Condensation attempts                : 0
% 0.17/0.45  # Condensation successes               : 0
% 0.17/0.45  # Termbank termtop insertions          : 3329
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.006 s
% 0.17/0.45  # System time              : 0.002 s
% 0.17/0.45  # Total time               : 0.008 s
% 0.17/0.45  # Maximum resident set size: 1788 pages
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.008 s
% 0.17/0.45  # System time              : 0.003 s
% 0.17/0.45  # Total time               : 0.011 s
% 0.17/0.45  # Maximum resident set size: 1704 pages
% 0.17/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------