↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWC255-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:43:40 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(co1_7,negated_conjecture,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_12,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

cnf(c_0_5,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    inference(fof_simplification,[status(thm)],[co1_11]) ).

cnf(c_0_6,negated_conjecture,
    neq(sk2,nil),
    inference(fof_simplification,[status(thm)],[co1_7]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    inference(fof_simplification,[status(thm)],[co1_12]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ neq(sk4,nil)
    | singletonP(sk3) ),
    c_0_5 ).

cnf(c_0_9,negated_conjecture,
    sk1 = sk3,
    co1_6 ).

cnf(c_0_10,negated_conjecture,
    sk2 = sk4,
    co1_5 ).

cnf(c_0_11,negated_conjecture,
    neq(sk2,nil),
    c_0_6 ).

cnf(c_0_12,negated_conjecture,
    ( ~ neq(sk4,nil)
    | ~ singletonP(sk1) ),
    c_0_7 ).

cnf(c_0_13,negated_conjecture,
    singletonP(sk1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWC255-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46  % Computer : n018.cluster.edu
% 0.21/0.46  % Model    : x86_64 x86_64
% 0.21/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46  % Memory   : 8046.5625MB
% 0.21/0.46  % OS       : Linux 6.8.0-71-generic
% 0.21/0.46  % CPULimit : 300
% 0.21/0.46  % WCLimit  : 300
% 0.21/0.46  % DateTime : Mon Sep 21 08:11:13 UTC 2026
% 0.21/0.47  % CPUTime  : 
% 0.21/0.47  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.55  Running first-order theorem proving
% 0.23/0.55  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.23/0.63  % Version: 3.5.1
% 0.23/0.63  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.63  % Starting sh5l with 300s (1) cores
% 0.23/0.63  % new_bool_3 with pid 1415587 completed with status 0
% 0.23/0.63  % Result found by new_bool_3
% 0.23/0.63  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.63  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.63  % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.23/0.63  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.63  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.63  % SubtermCWHack with pid 1415595 completed with status 0
% 0.23/0.63  % Result found by SubtermCWHack
% 0.23/0.63  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.63  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.63  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.63  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.63  % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.23/0.63  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.63  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.63  % Preprocessing time       : 0.002 s
% 0.23/0.63  
% 0.23/0.63  % Proof found!
% 0.23/0.63  % SZS status Unsatisfiable
% 0.23/0.63  % SZS output start CNFRefutation
% See solution above
% 0.23/0.63  % Parsed axioms                        : 197
% 0.23/0.63  % Removed by relevancy pruning/SinE    : 162
% 0.23/0.63  % Initial clauses                      : 35
% 0.23/0.63  % Removed in clause preprocessing      : 0
% 0.23/0.63  % Initial clauses in saturation        : 35
% 0.23/0.63  % Processed clauses                    : 13
% 0.23/0.63  % ...of these trivial                  : 2
% 0.23/0.63  % ...subsumed                          : 0
% 0.23/0.63  % ...remaining for further processing  : 10
% 0.23/0.63  % Other redundant clauses eliminated   : 0
% 0.23/0.63  % Clauses deleted for lack of memory   : 0
% 0.23/0.63  % Backward-subsumed                    : 0
% 0.23/0.63  % Backward-rewritten                   : 2
% 0.23/0.63  % Generated clauses                    : 0
% 0.23/0.63  % ...of the previous two non-redundant : 0
% 0.23/0.63  % ...aggressively subsumed             : 0
% 0.23/0.63  % Contextual simplify-reflections      : 0
% 0.23/0.63  % Paramodulations                      : 0
% 0.23/0.63  % Factorizations                       : 0
% 0.23/0.63  % NegExts                              : 0
% 0.23/0.63  % Equation resolutions                 : 0
% 0.23/0.63  % Disequality decompositions           : 0
% 0.23/0.63  % Total rewrite steps                  : 13
% 0.23/0.63  % ...of those cached                   : 7
% 0.23/0.63  % Propositional unsat checks           : 0
% 0.23/0.63  %    Propositional check models        : 0
% 0.23/0.63  %    Propositional check unsatisfiable : 0
% 0.23/0.63  %    Propositional clauses             : 0
% 0.23/0.63  %    Propositional clauses after purity: 0
% 0.23/0.63  %    Propositional unsat core size     : 0
% 0.23/0.63  %    Propositional preprocessing time  : 0.000
% 0.23/0.63  %    Propositional encoding time       : 0.000
% 0.23/0.63  %    Propositional solver time         : 0.000
% 0.23/0.63  %    Success case prop preproc time    : 0.000
% 0.23/0.63  %    Success case prop encoding time   : 0.000
% 0.23/0.63  %    Success case prop solver time     : 0.000
% 0.23/0.63  % Current number of processed clauses  : 8
% 0.23/0.63  %    Positive orientable unit clauses  : 7
% 0.23/0.63  %    Positive unorientable unit clauses: 0
% 0.23/0.63  %    Negative unit clauses             : 1
% 0.23/0.63  %    Non-unit-clauses                  : 0
% 0.23/0.63  % Current number of unprocessed clauses: 22
% 0.23/0.63  % ...number of literals in the above   : 84
% 0.23/0.63  % Current number of archived formulas  : 0
% 0.23/0.63  % Current number of archived clauses   : 2
% 0.23/0.63  % Clause-clause subsumption calls (NU) : 0
% 0.23/0.63  % Rec. Clause-clause subsumption calls : 0
% 0.23/0.63  % Non-unit clause-clause subsumptions  : 0
% 0.23/0.63  % Unit Clause-clause subsumption calls : 0
% 0.23/0.63  % Rewrite failures with RHS unbound    : 0
% 0.23/0.63  % BW rewrite match attempts            : 2
% 0.23/0.63  % BW rewrite match successes           : 2
% 0.23/0.63  % Condensation attempts                : 0
% 0.23/0.63  % Condensation successes               : 0
% 0.23/0.63  % Termbank termtop insertions          : 2714
% 0.23/0.63  % Search garbage collected termcells   : 923
% 0.23/0.63  
% 0.23/0.63  % -------------------------------------------------
% 0.23/0.63  % User time                : 0.009 s
% 0.23/0.63  % System time              : 0.000 s
% 0.23/0.63  % Total time               : 0.009 s
% 0.23/0.63  % Maximum resident set size: 4012 pages
% 0.23/0.63  
% 0.23/0.63  % -------------------------------------------------
% 0.23/0.63  % User time                : 0.017 s
% 0.23/0.63  % System time              : 0.006 s
% 0.23/0.63  % Total time               : 0.023 s
% 0.23/0.63  % Maximum resident set size: 4864 pages
% 0.23/0.63  % E exiting
%------------------------------------------------------------------------------