TSTP Solution File: SYN299-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYN299-1 : TPTP v8.2.0. 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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 07:44:04 EDT 2024

% Result   : Unsatisfiable 0.12s 0.45s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   29 (  12 unt;   0 nHn;  25 RR)
%            Number of literals    :   56 (   0 equ;  31 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   35 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
    ( p1(X1,X1,X1)
    | ~ p0(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).

cnf(rule_181,axiom,
    ( q2(X1,X1,X1)
    | ~ p1(X1,X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(rule_273,axiom,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).

cnf(rule_125,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(prove_this,negated_conjecture,
    ~ s3(b,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

cnf(rule_189,axiom,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).

cnf(axiom_38,axiom,
    m0(b,a,a),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_38) ).

cnf(c_0_8,plain,
    ( p1(X1,X1,X1)
    | ~ p0(X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_085]) ).

cnf(c_0_9,plain,
    ( q2(X1,X1,X1)
    | ~ p1(X1,X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_181]) ).

cnf(c_0_10,plain,
    ( p1(X1,X1,X1)
    | ~ p0(X2,X1) ),
    c_0_8 ).

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

cnf(c_0_12,plain,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    inference(fof_simplification,[status(thm)],[rule_273]) ).

cnf(c_0_13,plain,
    ( q2(X1,X1,X1)
    | ~ p1(X1,X1,X1) ),
    c_0_9 ).

cnf(c_0_14,plain,
    p1(X1,X1,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    inference(fof_simplification,[status(thm)],[rule_125]) ).

cnf(c_0_16,plain,
    ( s3(X1,X2)
    | ~ q2(X3,X1,X3)
    | ~ s2(X1)
    | ~ m0(X3,X4,X2) ),
    c_0_12 ).

cnf(c_0_17,plain,
    q2(X1,X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).

cnf(c_0_18,negated_conjecture,
    ~ s3(b,a),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_19,plain,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    inference(fof_simplification,[status(thm)],[rule_189]) ).

cnf(c_0_20,plain,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    c_0_15 ).

cnf(c_0_21,plain,
    ( s3(X1,X2)
    | ~ s2(X1)
    | ~ m0(X1,X3,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,axiom,
    m0(b,a,a),
    axiom_38 ).

cnf(c_0_23,negated_conjecture,
    ~ s3(b,a),
    c_0_18 ).

cnf(c_0_24,plain,
    ( s2(X1)
    | ~ q2(b,X1,b)
    | ~ s1(b) ),
    c_0_19 ).

cnf(c_0_25,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_20,c_0_11]) ).

cnf(c_0_26,plain,
    ~ s2(b),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_27,plain,
    ( s2(X1)
    | ~ q2(b,X1,b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_28,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SYN299-1 : TPTP v8.2.0. Released v1.1.0.
% 0.05/0.10  % Command    : run_E %s %d THM
% 0.09/0.29  % Computer : n019.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 300
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Mon May 20 15:53:37 EDT 2024
% 0.09/0.29  % CPUTime    : 
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.12/0.45  # Version: 3.1.0
% 0.12/0.45  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  # Starting sh5l with 300s (1) cores
% 0.12/0.45  # new_bool_3 with pid 29876 completed with status 0
% 0.12/0.45  # Result found by new_bool_3
% 0.12/0.45  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.45  # SAT001_MinMin_p005000_rr_RG with pid 29886 completed with status 0
% 0.12/0.45  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.12/0.45  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.12/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.45  # Preprocessing time       : 0.003 s
% 0.12/0.45  # Presaturation interreduction done
% 0.12/0.45  
% 0.12/0.45  # Proof found!
% 0.12/0.45  # SZS status Unsatisfiable
% 0.12/0.45  # SZS output start CNFRefutation
% See solution above
% 0.12/0.45  # Parsed axioms                        : 369
% 0.12/0.45  # Removed by relevancy pruning/SinE    : 24
% 0.12/0.45  # Initial clauses                      : 345
% 0.12/0.45  # Removed in clause preprocessing      : 6
% 0.12/0.45  # Initial clauses in saturation        : 339
% 0.12/0.45  # Processed clauses                    : 1155
% 0.12/0.45  # ...of these trivial                  : 59
% 0.12/0.45  # ...subsumed                          : 68
% 0.12/0.45  # ...remaining for further processing  : 1028
% 0.12/0.45  # Other redundant clauses eliminated   : 0
% 0.12/0.45  # Clauses deleted for lack of memory   : 0
% 0.12/0.45  # Backward-subsumed                    : 56
% 0.12/0.45  # Backward-rewritten                   : 247
% 0.12/0.45  # Generated clauses                    : 1580
% 0.12/0.45  # ...of the previous two non-redundant : 1048
% 0.12/0.45  # ...aggressively subsumed             : 0
% 0.12/0.45  # Contextual simplify-reflections      : 2
% 0.12/0.45  # Paramodulations                      : 1580
% 0.12/0.45  # Factorizations                       : 0
% 0.12/0.45  # NegExts                              : 0
% 0.12/0.45  # Equation resolutions                 : 0
% 0.12/0.45  # Disequality decompositions           : 0
% 0.12/0.45  # Total rewrite steps                  : 1201
% 0.12/0.45  # ...of those cached                   : 896
% 0.12/0.45  # Propositional unsat checks           : 0
% 0.12/0.45  #    Propositional check models        : 0
% 0.12/0.45  #    Propositional check unsatisfiable : 0
% 0.12/0.45  #    Propositional clauses             : 0
% 0.12/0.45  #    Propositional clauses after purity: 0
% 0.12/0.45  #    Propositional unsat core size     : 0
% 0.12/0.45  #    Propositional preprocessing time  : 0.000
% 0.12/0.45  #    Propositional encoding time       : 0.000
% 0.12/0.45  #    Propositional solver time         : 0.000
% 0.12/0.45  #    Success case prop preproc time    : 0.000
% 0.12/0.45  #    Success case prop encoding time   : 0.000
% 0.12/0.45  #    Success case prop solver time     : 0.000
% 0.12/0.45  # Current number of processed clauses  : 420
% 0.12/0.45  #    Positive orientable unit clauses  : 195
% 0.12/0.45  #    Positive unorientable unit clauses: 0
% 0.12/0.45  #    Negative unit clauses             : 2
% 0.12/0.45  #    Non-unit-clauses                  : 223
% 0.12/0.45  # Current number of unprocessed clauses: 336
% 0.12/0.45  # ...number of literals in the above   : 991
% 0.12/0.45  # Current number of archived formulas  : 0
% 0.12/0.45  # Current number of archived clauses   : 608
% 0.12/0.45  # Clause-clause subsumption calls (NU) : 45144
% 0.12/0.45  # Rec. Clause-clause subsumption calls : 32757
% 0.12/0.45  # Non-unit clause-clause subsumptions  : 117
% 0.12/0.45  # Unit Clause-clause subsumption calls : 3096
% 0.12/0.45  # Rewrite failures with RHS unbound    : 0
% 0.12/0.45  # BW rewrite match attempts            : 544
% 0.12/0.45  # BW rewrite match successes           : 157
% 0.12/0.45  # Condensation attempts                : 0
% 0.12/0.45  # Condensation successes               : 0
% 0.12/0.45  # Termbank termtop insertions          : 29542
% 0.12/0.45  # Search garbage collected termcells   : 1491
% 0.12/0.45  
% 0.12/0.45  # -------------------------------------------------
% 0.12/0.45  # User time                : 0.052 s
% 0.12/0.45  # System time              : 0.004 s
% 0.12/0.45  # Total time               : 0.056 s
% 0.12/0.45  # Maximum resident set size: 2636 pages
% 0.12/0.45  
% 0.12/0.45  # -------------------------------------------------
% 0.12/0.45  # User time                : 0.057 s
% 0.12/0.45  # System time              : 0.004 s
% 0.12/0.45  # Total time               : 0.061 s
% 0.12/0.45  # Maximum resident set size: 2020 pages
% 0.12/0.45  % E---3.1 exiting
% 0.12/0.46  % E exiting
%------------------------------------------------------------------------------