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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYN191-1 : TPTP v8.2.0. Released v1.1.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 07:43:42 EDT 2024

% Result   : Unsatisfiable 0.85s 0.57s
% Output   : CNFRefutation 0.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   32 (  16 unt;   0 nHn;  28 RR)
%            Number of literals    :   57 (   0 equ;  28 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   :   38 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_029,axiom,
    ( m1(X1,X2,X1)
    | ~ p0(X1,X2)
    | ~ s0(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_029) ).

cnf(rule_057,axiom,
    ( n1(X1,X1,X1)
    | ~ r0(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_057) ).

cnf(rule_176,axiom,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_176) ).

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

cnf(axiom_5,axiom,
    s0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).

cnf(rule_152,axiom,
    ( p2(X1,X2,X2)
    | ~ n1(X3,X2,X3)
    | ~ p0(X1,X2)
    | ~ p2(X1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_152) ).

cnf(axiom_9,axiom,
    r0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_9) ).

cnf(rule_267,axiom,
    ( r3(X1,X2,X1)
    | ~ p2(X1,X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_267) ).

cnf(axiom_18,axiom,
    p0(c,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).

cnf(prove_this,negated_conjecture,
    ~ r3(c,b,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_10,plain,
    ( m1(X1,X2,X1)
    | ~ p0(X1,X2)
    | ~ s0(X1) ),
    inference(fof_simplification,[status(thm)],[rule_029]) ).

cnf(c_0_11,plain,
    ( n1(X1,X1,X1)
    | ~ r0(X1) ),
    inference(fof_simplification,[status(thm)],[rule_057]) ).

cnf(c_0_12,plain,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    inference(fof_simplification,[status(thm)],[rule_176]) ).

cnf(c_0_13,plain,
    ( m1(X1,X2,X1)
    | ~ p0(X1,X2)
    | ~ s0(X1) ),
    c_0_10 ).

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

cnf(c_0_15,axiom,
    s0(b),
    axiom_5 ).

cnf(c_0_16,plain,
    ( p2(X1,X2,X2)
    | ~ n1(X3,X2,X3)
    | ~ p0(X1,X2)
    | ~ p2(X1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[rule_152]) ).

cnf(c_0_17,plain,
    ( n1(X1,X1,X1)
    | ~ r0(X1) ),
    c_0_11 ).

cnf(c_0_18,axiom,
    r0(b),
    axiom_9 ).

cnf(c_0_19,plain,
    ( p2(X1,X2,X1)
    | ~ m1(X2,X1,X2) ),
    c_0_12 ).

cnf(c_0_20,plain,
    m1(b,X1,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_21,plain,
    ( p2(X1,X2,X2)
    | ~ n1(X3,X2,X3)
    | ~ p0(X1,X2)
    | ~ p2(X1,X2,X1) ),
    c_0_16 ).

cnf(c_0_22,plain,
    n1(b,b,b),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    p2(X1,b,X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( r3(X1,X2,X1)
    | ~ p2(X1,X3,X2) ),
    inference(fof_simplification,[status(thm)],[rule_267]) ).

cnf(c_0_25,plain,
    ( p2(X1,b,b)
    | ~ p0(X1,b) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).

cnf(c_0_26,axiom,
    p0(c,b),
    axiom_18 ).

cnf(c_0_27,negated_conjecture,
    ~ r3(c,b,c),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_28,plain,
    ( r3(X1,X2,X1)
    | ~ p2(X1,X3,X2) ),
    c_0_24 ).

cnf(c_0_29,plain,
    p2(c,b,b),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ~ r3(c,b,c),
    c_0_27 ).

cnf(c_0_31,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN191-1 : TPTP v8.2.0. Released v1.1.0.
% 0.12/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   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 15:50:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  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/benchmark/theBenchmark.p
% 0.85/0.57  # Version: 3.1.0
% 0.85/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.85/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.85/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.85/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.85/0.57  # Starting sh5l with 300s (1) cores
% 0.85/0.57  # new_bool_1 with pid 23232 completed with status 0
% 0.85/0.57  # Result found by new_bool_1
% 0.85/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.85/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.85/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.85/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.85/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.85/0.57  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.85/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.85/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.85/0.57  # SAT001_MinMin_p005000_rr_RG with pid 23240 completed with status 0
% 0.85/0.57  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.85/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.85/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.85/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.85/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.85/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.85/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.85/0.57  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.85/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.85/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.85/0.57  # Preprocessing time       : 0.005 s
% 0.85/0.57  # Presaturation interreduction done
% 0.85/0.57  
% 0.85/0.57  # Proof found!
% 0.85/0.57  # SZS status Unsatisfiable
% 0.85/0.57  # SZS output start CNFRefutation
% See solution above
% 0.85/0.57  # Parsed axioms                        : 369
% 0.85/0.57  # Removed by relevancy pruning/SinE    : 38
% 0.85/0.57  # Initial clauses                      : 331
% 0.85/0.57  # Removed in clause preprocessing      : 5
% 0.85/0.57  # Initial clauses in saturation        : 326
% 0.85/0.57  # Processed clauses                    : 806
% 0.85/0.57  # ...of these trivial                  : 33
% 0.85/0.57  # ...subsumed                          : 30
% 0.85/0.57  # ...remaining for further processing  : 743
% 0.85/0.57  # Other redundant clauses eliminated   : 0
% 0.85/0.57  # Clauses deleted for lack of memory   : 0
% 0.85/0.57  # Backward-subsumed                    : 15
% 0.85/0.57  # Backward-rewritten                   : 59
% 0.85/0.57  # Generated clauses                    : 916
% 0.85/0.57  # ...of the previous two non-redundant : 624
% 0.85/0.57  # ...aggressively subsumed             : 0
% 0.85/0.57  # Contextual simplify-reflections      : 1
% 0.85/0.57  # Paramodulations                      : 916
% 0.85/0.57  # Factorizations                       : 0
% 0.85/0.57  # NegExts                              : 0
% 0.85/0.57  # Equation resolutions                 : 0
% 0.85/0.57  # Disequality decompositions           : 0
% 0.85/0.57  # Total rewrite steps                  : 619
% 0.85/0.57  # ...of those cached                   : 461
% 0.85/0.57  # Propositional unsat checks           : 0
% 0.85/0.57  #    Propositional check models        : 0
% 0.85/0.57  #    Propositional check unsatisfiable : 0
% 0.85/0.57  #    Propositional clauses             : 0
% 0.85/0.57  #    Propositional clauses after purity: 0
% 0.85/0.57  #    Propositional unsat core size     : 0
% 0.85/0.57  #    Propositional preprocessing time  : 0.000
% 0.85/0.57  #    Propositional encoding time       : 0.000
% 0.85/0.57  #    Propositional solver time         : 0.000
% 0.85/0.57  #    Success case prop preproc time    : 0.000
% 0.85/0.57  #    Success case prop encoding time   : 0.000
% 0.85/0.57  #    Success case prop solver time     : 0.000
% 0.85/0.57  # Current number of processed clauses  : 377
% 0.85/0.57  #    Positive orientable unit clauses  : 134
% 0.85/0.57  #    Positive unorientable unit clauses: 0
% 0.85/0.57  #    Negative unit clauses             : 2
% 0.85/0.57  #    Non-unit-clauses                  : 241
% 0.85/0.57  # Current number of unprocessed clauses: 415
% 0.85/0.57  # ...number of literals in the above   : 1041
% 0.85/0.57  # Current number of archived formulas  : 0
% 0.85/0.57  # Current number of archived clauses   : 366
% 0.85/0.57  # Clause-clause subsumption calls (NU) : 34254
% 0.85/0.57  # Rec. Clause-clause subsumption calls : 24025
% 0.85/0.57  # Non-unit clause-clause subsumptions  : 35
% 0.85/0.57  # Unit Clause-clause subsumption calls : 354
% 0.85/0.57  # Rewrite failures with RHS unbound    : 0
% 0.85/0.57  # BW rewrite match attempts            : 99
% 0.85/0.57  # BW rewrite match successes           : 53
% 0.85/0.57  # Condensation attempts                : 0
% 0.85/0.57  # Condensation successes               : 0
% 0.85/0.57  # Termbank termtop insertions          : 22299
% 0.85/0.57  # Search garbage collected termcells   : 1515
% 0.85/0.57  
% 0.85/0.57  # -------------------------------------------------
% 0.85/0.57  # User time                : 0.063 s
% 0.85/0.57  # System time              : 0.005 s
% 0.85/0.57  # Total time               : 0.068 s
% 0.85/0.57  # Maximum resident set size: 2608 pages
% 0.85/0.57  
% 0.85/0.57  # -------------------------------------------------
% 0.85/0.57  # User time                : 0.068 s
% 0.85/0.57  # System time              : 0.008 s
% 0.85/0.57  # Total time               : 0.076 s
% 0.85/0.57  # Maximum resident set size: 2020 pages
% 0.85/0.57  % E---3.1 exiting
% 0.85/0.57  % E exiting
%------------------------------------------------------------------------------