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

View Problem - Process Solution

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

% Computer : n019.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:07 EDT 2023

% Result   : Unsatisfiable 0.59s 0.57s
% Output   : CNFRefutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  12 unt;   0 nHn;  14 RR)
%            Number of literals    :   35 (   0 equ;  18 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    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   28 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',rule_126) ).

cnf(axiom_17,axiom,
    q0(X1,d),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',axiom_17) ).

cnf(rule_125,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',rule_125) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',axiom_14) ).

cnf(rule_133,axiom,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ s1(X3)
    | ~ m0(X4,X3,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',rule_133) ).

cnf(axiom_16,axiom,
    m0(c,b,a),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',axiom_16) ).

cnf(prove_this,negated_conjecture,
    ~ l2(a,a),
    file('/export/starexec/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p',prove_this) ).

cnf(c_0_7,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    rule_126 ).

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

cnf(c_0_9,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    rule_125 ).

cnf(c_0_10,axiom,
    p0(b,X1),
    axiom_14 ).

cnf(c_0_11,plain,
    ( s1(X1)
    | ~ s1(X2) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,axiom,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ s1(X3)
    | ~ m0(X4,X3,X1) ),
    rule_133 ).

cnf(c_0_14,plain,
    s1(X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( l2(X1,X1)
    | ~ p0(X2,X2)
    | ~ m0(X3,X4,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_16,axiom,
    m0(c,b,a),
    axiom_16 ).

cnf(c_0_17,negated_conjecture,
    ~ l2(a,a),
    prove_this ).

cnf(c_0_18,plain,
    ~ p0(X1,X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_19,plain,
    $false,
    inference(spm,[status(thm)],[c_0_18,c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem    : SYN216-1 : TPTP v8.1.2. Released v1.1.0.
% 0.15/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n019.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 18:22:51 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.SbJYTHYE5Z/E---3.1_27963.p
% 0.59/0.57  # Version: 3.1pre001
% 0.59/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.59/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.59/0.57  # Starting sh5l with 300s (1) cores
% 0.59/0.57  # new_bool_1 with pid 28043 completed with status 0
% 0.59/0.57  # Result found by new_bool_1
% 0.59/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.59/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.59/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.59/0.57  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.59/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.59/0.57  # SAT001_MinMin_p005000_rr_RG with pid 28050 completed with status 0
% 0.59/0.57  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.59/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.59/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.59/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.59/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.59/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.59/0.57  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.59/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.59/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.59/0.57  # Preprocessing time       : 0.004 s
% 0.59/0.57  # Presaturation interreduction done
% 0.59/0.57  
% 0.59/0.57  # Proof found!
% 0.59/0.57  # SZS status Unsatisfiable
% 0.59/0.57  # SZS output start CNFRefutation
% See solution above
% 0.59/0.57  # Parsed axioms                        : 369
% 0.59/0.57  # Removed by relevancy pruning/SinE    : 55
% 0.59/0.57  # Initial clauses                      : 314
% 0.59/0.57  # Removed in clause preprocessing      : 5
% 0.59/0.57  # Initial clauses in saturation        : 309
% 0.59/0.57  # Processed clauses                    : 647
% 0.59/0.57  # ...of these trivial                  : 34
% 0.59/0.57  # ...subsumed                          : 22
% 0.59/0.57  # ...remaining for further processing  : 591
% 0.59/0.57  # Other redundant clauses eliminated   : 0
% 0.59/0.57  # Clauses deleted for lack of memory   : 0
% 0.59/0.57  # Backward-subsumed                    : 16
% 0.59/0.57  # Backward-rewritten                   : 119
% 0.59/0.57  # Generated clauses                    : 433
% 0.59/0.57  # ...of the previous two non-redundant : 242
% 0.59/0.57  # ...aggressively subsumed             : 0
% 0.59/0.57  # Contextual simplify-reflections      : 1
% 0.59/0.57  # Paramodulations                      : 433
% 0.59/0.57  # Factorizations                       : 0
% 0.59/0.57  # NegExts                              : 0
% 0.59/0.57  # Equation resolutions                 : 0
% 0.59/0.57  # Total rewrite steps                  : 482
% 0.59/0.57  # Propositional unsat checks           : 0
% 0.59/0.57  #    Propositional check models        : 0
% 0.59/0.57  #    Propositional check unsatisfiable : 0
% 0.59/0.57  #    Propositional clauses             : 0
% 0.59/0.57  #    Propositional clauses after purity: 0
% 0.59/0.57  #    Propositional unsat core size     : 0
% 0.59/0.57  #    Propositional preprocessing time  : 0.000
% 0.59/0.57  #    Propositional encoding time       : 0.000
% 0.59/0.57  #    Propositional solver time         : 0.000
% 0.59/0.57  #    Success case prop preproc time    : 0.000
% 0.59/0.57  #    Success case prop encoding time   : 0.000
% 0.59/0.57  #    Success case prop solver time     : 0.000
% 0.59/0.57  # Current number of processed clauses  : 182
% 0.59/0.57  #    Positive orientable unit clauses  : 89
% 0.59/0.57  #    Positive unorientable unit clauses: 0
% 0.59/0.57  #    Negative unit clauses             : 2
% 0.59/0.57  #    Non-unit-clauses                  : 91
% 0.59/0.57  # Current number of unprocessed clauses: 154
% 0.59/0.57  # ...number of literals in the above   : 455
% 0.59/0.57  # Current number of archived formulas  : 0
% 0.59/0.57  # Current number of archived clauses   : 409
% 0.59/0.57  # Clause-clause subsumption calls (NU) : 20201
% 0.59/0.57  # Rec. Clause-clause subsumption calls : 14406
% 0.59/0.57  # Non-unit clause-clause subsumptions  : 29
% 0.59/0.57  # Unit Clause-clause subsumption calls : 764
% 0.59/0.57  # Rewrite failures with RHS unbound    : 0
% 0.59/0.57  # BW rewrite match attempts            : 170
% 0.59/0.57  # BW rewrite match successes           : 87
% 0.59/0.57  # Condensation attempts                : 0
% 0.59/0.57  # Condensation successes               : 0
% 0.59/0.57  # Termbank termtop insertions          : 12872
% 0.59/0.57  
% 0.59/0.57  # -------------------------------------------------
% 0.59/0.57  # User time                : 0.045 s
% 0.59/0.57  # System time              : 0.002 s
% 0.59/0.57  # Total time               : 0.047 s
% 0.59/0.57  # Maximum resident set size: 2452 pages
% 0.59/0.57  
% 0.59/0.57  # -------------------------------------------------
% 0.59/0.57  # User time                : 0.052 s
% 0.59/0.57  # System time              : 0.003 s
% 0.59/0.57  # Total time               : 0.055 s
% 0.59/0.57  # Maximum resident set size: 2000 pages
% 0.59/0.57  % E---3.1 exiting
% 0.59/0.57  % E---3.1 exiting
%------------------------------------------------------------------------------