TSTP Solution File: SYN187-1 by E---3.1

View Problem - Process Solution

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

% Computer : n001.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 20:14:02 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_124,axiom,
    ( r1(X1)
    | ~ q0(X1,X2)
    | ~ s0(d)
    | ~ q1(d,X2,d) ),
    file('/export/starexec/sandbox/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p',rule_124) ).

cnf(axiom_1,axiom,
    s0(d),
    file('/export/starexec/sandbox/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p',axiom_1) ).

cnf(rule_117,axiom,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    file('/export/starexec/sandbox/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p',rule_117) ).

cnf(axiom_28,axiom,
    k0(e),
    file('/export/starexec/sandbox/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p',axiom_28) ).

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p',axiom_17) ).

cnf(prove_this,negated_conjecture,
    ~ r1(d),
    file('/export/starexec/sandbox/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p',prove_this) ).

cnf(c_0_6,axiom,
    ( r1(X1)
    | ~ q0(X1,X2)
    | ~ s0(d)
    | ~ q1(d,X2,d) ),
    rule_124 ).

cnf(c_0_7,axiom,
    s0(d),
    axiom_1 ).

cnf(c_0_8,axiom,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    rule_117 ).

cnf(c_0_9,axiom,
    k0(e),
    axiom_28 ).

cnf(c_0_10,plain,
    ( r1(X1)
    | ~ q1(d,X2,d)
    | ~ q0(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

cnf(c_0_11,axiom,
    q0(X1,d),
    axiom_17 ).

cnf(c_0_12,plain,
    q1(d,d,d),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9])]) ).

cnf(c_0_13,negated_conjecture,
    ~ r1(d),
    prove_this ).

cnf(c_0_14,plain,
    r1(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : SYN187-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.16  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n001.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 2400
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Mon Oct  2 18:34:51 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.22/0.52  Running first-order theorem proving
% 0.22/0.52  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/tmp/tmp.bNCWn6Evp9/E---3.1_13204.p
% 0.22/0.57  # Version: 3.1pre001
% 0.22/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  # Starting sh5l with 300s (1) cores
% 0.22/0.57  # new_bool_1 with pid 13394 completed with status 0
% 0.22/0.57  # Result found by new_bool_1
% 0.22/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.57  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.22/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.57  # SAT001_MinMin_p005000_rr_RG with pid 13400 completed with status 0
% 0.22/0.57  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.57  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.22/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.57  # Preprocessing time       : 0.005 s
% 0.22/0.57  # Presaturation interreduction done
% 0.22/0.57  
% 0.22/0.57  # Proof found!
% 0.22/0.57  # SZS status Unsatisfiable
% 0.22/0.57  # SZS output start CNFRefutation
% See solution above
% 0.22/0.57  # Parsed axioms                        : 369
% 0.22/0.57  # Removed by relevancy pruning/SinE    : 53
% 0.22/0.57  # Initial clauses                      : 316
% 0.22/0.57  # Removed in clause preprocessing      : 5
% 0.22/0.57  # Initial clauses in saturation        : 311
% 0.22/0.57  # Processed clauses                    : 436
% 0.22/0.57  # ...of these trivial                  : 11
% 0.22/0.57  # ...subsumed                          : 24
% 0.22/0.57  # ...remaining for further processing  : 401
% 0.22/0.57  # Other redundant clauses eliminated   : 0
% 0.22/0.57  # Clauses deleted for lack of memory   : 0
% 0.22/0.57  # Backward-subsumed                    : 4
% 0.22/0.57  # Backward-rewritten                   : 21
% 0.22/0.57  # Generated clauses                    : 72
% 0.22/0.57  # ...of the previous two non-redundant : 65
% 0.22/0.57  # ...aggressively subsumed             : 0
% 0.22/0.57  # Contextual simplify-reflections      : 1
% 0.22/0.57  # Paramodulations                      : 72
% 0.22/0.57  # Factorizations                       : 0
% 0.22/0.57  # NegExts                              : 0
% 0.22/0.57  # Equation resolutions                 : 0
% 0.22/0.57  # Total rewrite steps                  : 106
% 0.22/0.57  # Propositional unsat checks           : 0
% 0.22/0.57  #    Propositional check models        : 0
% 0.22/0.57  #    Propositional check unsatisfiable : 0
% 0.22/0.57  #    Propositional clauses             : 0
% 0.22/0.57  #    Propositional clauses after purity: 0
% 0.22/0.57  #    Propositional unsat core size     : 0
% 0.22/0.57  #    Propositional preprocessing time  : 0.000
% 0.22/0.57  #    Propositional encoding time       : 0.000
% 0.22/0.57  #    Propositional solver time         : 0.000
% 0.22/0.57  #    Success case prop preproc time    : 0.000
% 0.22/0.57  #    Success case prop encoding time   : 0.000
% 0.22/0.57  #    Success case prop solver time     : 0.000
% 0.22/0.57  # Current number of processed clauses  : 101
% 0.22/0.57  #    Positive orientable unit clauses  : 66
% 0.22/0.57  #    Positive unorientable unit clauses: 0
% 0.22/0.57  #    Negative unit clauses             : 0
% 0.22/0.57  #    Non-unit-clauses                  : 35
% 0.22/0.57  # Current number of unprocessed clauses: 211
% 0.22/0.57  # ...number of literals in the above   : 628
% 0.22/0.57  # Current number of archived formulas  : 0
% 0.22/0.57  # Current number of archived clauses   : 300
% 0.22/0.57  # Clause-clause subsumption calls (NU) : 16237
% 0.22/0.57  # Rec. Clause-clause subsumption calls : 10630
% 0.22/0.57  # Non-unit clause-clause subsumptions  : 27
% 0.22/0.57  # Unit Clause-clause subsumption calls : 97
% 0.22/0.57  # Rewrite failures with RHS unbound    : 0
% 0.22/0.57  # BW rewrite match attempts            : 24
% 0.22/0.57  # BW rewrite match successes           : 19
% 0.22/0.57  # Condensation attempts                : 0
% 0.22/0.57  # Condensation successes               : 0
% 0.22/0.57  # Termbank termtop insertions          : 9078
% 0.22/0.57  
% 0.22/0.57  # -------------------------------------------------
% 0.22/0.57  # User time                : 0.028 s
% 0.22/0.57  # System time              : 0.008 s
% 0.22/0.57  # Total time               : 0.036 s
% 0.22/0.57  # Maximum resident set size: 2456 pages
% 0.22/0.57  
% 0.22/0.57  # -------------------------------------------------
% 0.22/0.57  # User time                : 0.034 s
% 0.22/0.57  # System time              : 0.011 s
% 0.22/0.57  # Total time               : 0.045 s
% 0.22/0.57  # Maximum resident set size: 2000 pages
% 0.22/0.57  % E---3.1 exiting
% 0.22/0.57  % E---3.1 exiting
%------------------------------------------------------------------------------