TSTP Solution File: SYN199-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n003.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 : Sat May  4 10:19:37 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(rule_125,axiom,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.fYYI8KCcTt/E---3.1_20636.p',rule_125) ).

cnf(rule_126,axiom,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    file('/export/starexec/sandbox/tmp/tmp.fYYI8KCcTt/E---3.1_20636.p',rule_126) ).

cnf(prove_this,negated_conjecture,
    ~ s1(d),
    file('/export/starexec/sandbox/tmp/tmp.fYYI8KCcTt/E---3.1_20636.p',prove_this) ).

cnf(axiom_14,axiom,
    p0(b,X1),
    file('/export/starexec/sandbox/tmp/tmp.fYYI8KCcTt/E---3.1_20636.p',axiom_14) ).

cnf(axiom_33,axiom,
    q0(d,c),
    file('/export/starexec/sandbox/tmp/tmp.fYYI8KCcTt/E---3.1_20636.p',axiom_33) ).

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

cnf(c_0_6,plain,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    inference(fof_simplification,[status(thm)],[rule_126]) ).

cnf(c_0_7,negated_conjecture,
    ~ s1(d),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_8,plain,
    ( s1(X1)
    | ~ p0(X1,X1) ),
    c_0_5 ).

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

cnf(c_0_10,plain,
    ( s1(X1)
    | ~ q0(X1,X2)
    | ~ s1(X3) ),
    c_0_6 ).

cnf(c_0_11,axiom,
    q0(d,c),
    axiom_33 ).

cnf(c_0_12,negated_conjecture,
    ~ s1(d),
    c_0_7 ).

cnf(c_0_13,plain,
    s1(b),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_15,plain,
    $false,
    inference(sr,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN199-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n003.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri May  3 10:45:50 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.50  Running first-order model finding
% 0.20/0.50  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.fYYI8KCcTt/E---3.1_20636.p
% 0.60/0.55  # Version: 3.1.0
% 0.60/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.60/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.60/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.60/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.60/0.55  # Starting sh5l with 300s (1) cores
% 0.60/0.55  # new_bool_3 with pid 20715 completed with status 0
% 0.60/0.55  # Result found by new_bool_3
% 0.60/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.60/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.60/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.60/0.55  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.60/0.55  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.60/0.55  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.60/0.55  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.60/0.55  # SAT001_MinMin_p005000_rr_RG with pid 20719 completed with status 0
% 0.60/0.55  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.60/0.55  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.60/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.55  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.60/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.60/0.55  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.60/0.55  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.60/0.55  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.60/0.55  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.60/0.55  # Preprocessing time       : 0.005 s
% 0.60/0.55  # Presaturation interreduction done
% 0.60/0.55  
% 0.60/0.55  # Proof found!
% 0.60/0.55  # SZS status Unsatisfiable
% 0.60/0.55  # SZS output start CNFRefutation
% See solution above
% 0.60/0.55  # Parsed axioms                        : 369
% 0.60/0.55  # Removed by relevancy pruning/SinE    : 48
% 0.60/0.55  # Initial clauses                      : 321
% 0.60/0.55  # Removed in clause preprocessing      : 5
% 0.60/0.55  # Initial clauses in saturation        : 316
% 0.60/0.55  # Processed clauses                    : 375
% 0.60/0.55  # ...of these trivial                  : 7
% 0.60/0.55  # ...subsumed                          : 23
% 0.60/0.55  # ...remaining for further processing  : 345
% 0.60/0.55  # Other redundant clauses eliminated   : 0
% 0.60/0.55  # Clauses deleted for lack of memory   : 0
% 0.60/0.55  # Backward-subsumed                    : 6
% 0.60/0.55  # Backward-rewritten                   : 4
% 0.60/0.55  # Generated clauses                    : 26
% 0.60/0.55  # ...of the previous two non-redundant : 21
% 0.60/0.55  # ...aggressively subsumed             : 0
% 0.60/0.55  # Contextual simplify-reflections      : 1
% 0.60/0.55  # Paramodulations                      : 25
% 0.60/0.55  # Factorizations                       : 0
% 0.60/0.55  # NegExts                              : 0
% 0.60/0.55  # Equation resolutions                 : 0
% 0.60/0.55  # Disequality decompositions           : 0
% 0.60/0.55  # Total rewrite steps                  : 76
% 0.60/0.55  # ...of those cached                   : 40
% 0.60/0.55  # Propositional unsat checks           : 0
% 0.60/0.55  #    Propositional check models        : 0
% 0.60/0.55  #    Propositional check unsatisfiable : 0
% 0.60/0.55  #    Propositional clauses             : 0
% 0.60/0.55  #    Propositional clauses after purity: 0
% 0.60/0.55  #    Propositional unsat core size     : 0
% 0.60/0.55  #    Propositional preprocessing time  : 0.000
% 0.60/0.55  #    Propositional encoding time       : 0.000
% 0.60/0.55  #    Propositional solver time         : 0.000
% 0.60/0.55  #    Success case prop preproc time    : 0.000
% 0.60/0.55  #    Success case prop encoding time   : 0.000
% 0.60/0.55  #    Success case prop solver time     : 0.000
% 0.60/0.55  # Current number of processed clauses  : 53
% 0.60/0.55  #    Positive orientable unit clauses  : 40
% 0.60/0.55  #    Positive unorientable unit clauses: 0
% 0.60/0.55  #    Negative unit clauses             : 1
% 0.60/0.55  #    Non-unit-clauses                  : 12
% 0.60/0.55  # Current number of unprocessed clauses: 243
% 0.60/0.55  # ...number of literals in the above   : 696
% 0.60/0.55  # Current number of archived formulas  : 0
% 0.60/0.55  # Current number of archived clauses   : 292
% 0.60/0.55  # Clause-clause subsumption calls (NU) : 16478
% 0.60/0.55  # Rec. Clause-clause subsumption calls : 10813
% 0.60/0.55  # Non-unit clause-clause subsumptions  : 26
% 0.60/0.55  # Unit Clause-clause subsumption calls : 40
% 0.60/0.55  # Rewrite failures with RHS unbound    : 0
% 0.60/0.55  # BW rewrite match attempts            : 5
% 0.60/0.55  # BW rewrite match successes           : 4
% 0.60/0.55  # Condensation attempts                : 0
% 0.60/0.55  # Condensation successes               : 0
% 0.60/0.55  # Termbank termtop insertions          : 11652
% 0.60/0.55  # Search garbage collected termcells   : 1526
% 0.60/0.55  
% 0.60/0.55  # -------------------------------------------------
% 0.60/0.55  # User time                : 0.030 s
% 0.60/0.55  # System time              : 0.006 s
% 0.60/0.55  # Total time               : 0.036 s
% 0.60/0.55  # Maximum resident set size: 2600 pages
% 0.60/0.55  
% 0.60/0.55  # -------------------------------------------------
% 0.60/0.55  # User time                : 0.037 s
% 0.60/0.55  # System time              : 0.008 s
% 0.60/0.55  # Total time               : 0.045 s
% 0.60/0.55  # Maximum resident set size: 2012 pages
% 0.60/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------