TSTP Solution File: RNG040-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : RNG040-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n007.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 19:15:28 EDT 2023

% Result   : Unsatisfiable 0.65s 0.56s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (  11 unt;   0 nHn;  15 RR)
%            Number of literals    :   28 (   0 equ;  15 neg)
%            Maximal clause size   :    5 (   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   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity3,axiom,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X4,X2,X5)
    | ~ sum(X1,X4,X6)
    | ~ product(X6,X2,X7) ),
    file('/export/starexec/sandbox/tmp/tmp.uXTgs8eCSZ/E---3.1_5844.p',distributivity3) ).

cnf(d_plus_a,negated_conjecture,
    product(d,a,additive_identity),
    file('/export/starexec/sandbox/tmp/tmp.uXTgs8eCSZ/E---3.1_5844.p',d_plus_a) ).

cnf(c_plus_a,negated_conjecture,
    product(c,a,n),
    file('/export/starexec/sandbox/tmp/tmp.uXTgs8eCSZ/E---3.1_5844.p',c_plus_a) ).

cnf(b_plus_a,negated_conjecture,
    product(b,a,l),
    file('/export/starexec/sandbox/tmp/tmp.uXTgs8eCSZ/E---3.1_5844.p',b_plus_a) ).

cnf(b_plus_c,negated_conjecture,
    sum(b,c,d),
    file('/export/starexec/sandbox/tmp/tmp.uXTgs8eCSZ/E---3.1_5844.p',b_plus_c) ).

cnf(prove_equation,negated_conjecture,
    ~ sum(l,n,additive_identity),
    file('/export/starexec/sandbox/tmp/tmp.uXTgs8eCSZ/E---3.1_5844.p',prove_equation) ).

cnf(c_0_6,axiom,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X4,X2,X5)
    | ~ sum(X1,X4,X6)
    | ~ product(X6,X2,X7) ),
    distributivity3 ).

cnf(c_0_7,negated_conjecture,
    product(d,a,additive_identity),
    d_plus_a ).

cnf(c_0_8,negated_conjecture,
    ( sum(X1,X2,additive_identity)
    | ~ product(X3,a,X2)
    | ~ product(X4,a,X1)
    | ~ sum(X4,X3,d) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    product(c,a,n),
    c_plus_a ).

cnf(c_0_10,negated_conjecture,
    ( sum(X1,n,additive_identity)
    | ~ product(X2,a,X1)
    | ~ sum(X2,c,d) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,negated_conjecture,
    product(b,a,l),
    b_plus_a ).

cnf(c_0_12,negated_conjecture,
    sum(b,c,d),
    b_plus_c ).

cnf(c_0_13,negated_conjecture,
    ~ sum(l,n,additive_identity),
    prove_equation ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : RNG040-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n007.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   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 19:32:54 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/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.uXTgs8eCSZ/E---3.1_5844.p
% 0.65/0.56  # Version: 3.1pre001
% 0.65/0.56  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.65/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.56  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.65/0.56  # Starting new_bool_3 with 300s (1) cores
% 0.65/0.56  # Starting new_bool_1 with 300s (1) cores
% 0.65/0.56  # Starting sh5l with 300s (1) cores
% 0.65/0.56  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 5921 completed with status 0
% 0.65/0.56  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.65/0.56  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.65/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.56  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.65/0.56  # No SInE strategy applied
% 0.65/0.56  # Search class: FGUSM-FFMS21-SFFFFFNN
% 0.65/0.56  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.65/0.56  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.65/0.56  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.65/0.56  # Starting new_bool_3 with 136s (1) cores
% 0.65/0.56  # Starting new_bool_1 with 136s (1) cores
% 0.65/0.56  # Starting sh5l with 136s (1) cores
% 0.65/0.56  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 5926 completed with status 0
% 0.65/0.56  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.65/0.56  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.65/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.56  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.65/0.56  # No SInE strategy applied
% 0.65/0.56  # Search class: FGUSM-FFMS21-SFFFFFNN
% 0.65/0.56  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.65/0.56  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.65/0.56  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.65/0.56  # Preprocessing time       : 0.001 s
% 0.65/0.56  # Presaturation interreduction done
% 0.65/0.56  
% 0.65/0.56  # Proof found!
% 0.65/0.56  # SZS status Unsatisfiable
% 0.65/0.56  # SZS output start CNFRefutation
% See solution above
% 0.65/0.56  # Parsed axioms                        : 27
% 0.65/0.56  # Removed by relevancy pruning/SinE    : 0
% 0.65/0.56  # Initial clauses                      : 27
% 0.65/0.56  # Removed in clause preprocessing      : 0
% 0.65/0.56  # Initial clauses in saturation        : 27
% 0.65/0.56  # Processed clauses                    : 896
% 0.65/0.56  # ...of these trivial                  : 139
% 0.65/0.56  # ...subsumed                          : 93
% 0.65/0.56  # ...remaining for further processing  : 664
% 0.65/0.56  # Other redundant clauses eliminated   : 0
% 0.65/0.56  # Clauses deleted for lack of memory   : 0
% 0.65/0.56  # Backward-subsumed                    : 2
% 0.65/0.56  # Backward-rewritten                   : 90
% 0.65/0.56  # Generated clauses                    : 3385
% 0.65/0.56  # ...of the previous two non-redundant : 2502
% 0.65/0.56  # ...aggressively subsumed             : 0
% 0.65/0.56  # Contextual simplify-reflections      : 0
% 0.65/0.56  # Paramodulations                      : 3385
% 0.65/0.56  # Factorizations                       : 0
% 0.65/0.56  # NegExts                              : 0
% 0.65/0.56  # Equation resolutions                 : 0
% 0.65/0.56  # Total rewrite steps                  : 1574
% 0.65/0.56  # Propositional unsat checks           : 0
% 0.65/0.56  #    Propositional check models        : 0
% 0.65/0.56  #    Propositional check unsatisfiable : 0
% 0.65/0.56  #    Propositional clauses             : 0
% 0.65/0.56  #    Propositional clauses after purity: 0
% 0.65/0.56  #    Propositional unsat core size     : 0
% 0.65/0.56  #    Propositional preprocessing time  : 0.000
% 0.65/0.56  #    Propositional encoding time       : 0.000
% 0.65/0.56  #    Propositional solver time         : 0.000
% 0.65/0.56  #    Success case prop preproc time    : 0.000
% 0.65/0.56  #    Success case prop encoding time   : 0.000
% 0.65/0.56  #    Success case prop solver time     : 0.000
% 0.65/0.56  # Current number of processed clauses  : 545
% 0.65/0.56  #    Positive orientable unit clauses  : 124
% 0.65/0.56  #    Positive unorientable unit clauses: 1
% 0.65/0.56  #    Negative unit clauses             : 1
% 0.65/0.56  #    Non-unit-clauses                  : 419
% 0.65/0.56  # Current number of unprocessed clauses: 1504
% 0.65/0.56  # ...number of literals in the above   : 4258
% 0.65/0.56  # Current number of archived formulas  : 0
% 0.65/0.56  # Current number of archived clauses   : 119
% 0.65/0.56  # Clause-clause subsumption calls (NU) : 19386
% 0.65/0.56  # Rec. Clause-clause subsumption calls : 15716
% 0.65/0.56  # Non-unit clause-clause subsumptions  : 94
% 0.65/0.56  # Unit Clause-clause subsumption calls : 571
% 0.65/0.56  # Rewrite failures with RHS unbound    : 0
% 0.65/0.56  # BW rewrite match attempts            : 233
% 0.65/0.56  # BW rewrite match successes           : 100
% 0.65/0.56  # Condensation attempts                : 0
% 0.65/0.56  # Condensation successes               : 0
% 0.65/0.56  # Termbank termtop insertions          : 41650
% 0.65/0.56  
% 0.65/0.56  # -------------------------------------------------
% 0.65/0.56  # User time                : 0.056 s
% 0.65/0.56  # System time              : 0.008 s
% 0.65/0.56  # Total time               : 0.064 s
% 0.65/0.56  # Maximum resident set size: 1652 pages
% 0.65/0.56  
% 0.65/0.56  # -------------------------------------------------
% 0.65/0.56  # User time                : 0.304 s
% 0.65/0.56  # System time              : 0.016 s
% 0.65/0.56  # Total time               : 0.320 s
% 0.65/0.56  # Maximum resident set size: 1692 pages
% 0.65/0.56  % E---3.1 exiting
%------------------------------------------------------------------------------