↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWC035-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 : n012.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:42:42 PM UTC 2026

% Result   : Unsatisfiable 0.07s 0.34s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   14 (  14 unt;   0 nHn;  14 RR)
%            Number of literals    :   14 (  13 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   0 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_6,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

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

cnf(co1_9,negated_conjecture,
    nil != sk1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

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

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

cnf(c_0_5,negated_conjecture,
    sk2 = sk4,
    co1_6 ).

cnf(c_0_6,negated_conjecture,
    nil = sk2,
    co1_5 ).

cnf(c_0_7,negated_conjecture,
    nil != sk1,
    inference(fof_simplification,[status(thm)],[co1_9]) ).

cnf(c_0_8,negated_conjecture,
    sk4 = sk3,
    co1_8 ).

cnf(c_0_9,negated_conjecture,
    sk4 = nil,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    nil != sk1,
    c_0_7 ).

cnf(c_0_11,negated_conjecture,
    sk1 = sk3,
    co1_7 ).

cnf(c_0_12,negated_conjecture,
    sk3 = nil,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

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

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