↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWB003+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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:38:41 PM UTC 2026

% Result   : Theorem 0.22s 0.49s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   7 unt;   0 def)
%            Number of atoms       :    7 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :    4 (   1 sgn   1   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals,conjecture,
    ? [X42] : iext(uri_ex_p,uri_ex_s,X42),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).

fof(testcase_premise_fullish_003_Blank_Nodes_for_Literals,axiom,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X42] : iext(uri_ex_p,uri_ex_s,X42),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_003_Blank_Nodes_for_Literals]) ).

fof(c_0_3,negated_conjecture,
    ! [X43] : ~ iext(uri_ex_p,uri_ex_s,X43),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_4,plain,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    inference(split_conjunct,[status(thm)],[testcase_premise_fullish_003_Blank_Nodes_for_Literals]) ).

cnf(c_0_5,negated_conjecture,
    ~ iext(uri_ex_p,uri_ex_s,X1),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    $false,
    inference(sr,[status(thm)],[c_0_4,c_0_5]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB003+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 07:36:40 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.22/0.49  % Version: 3.5.1
% 0.22/0.49  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.22/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.22/0.49  % Starting new_bool_3 with 600s (2) cores
% 0.22/0.49  % Starting new_bool_1 with 600s (2) cores
% 0.22/0.49  % Starting sh5l with 300s (1) cores
% 0.22/0.49  % new_bool_3 with pid 1357364 completed with status 9
% 0.22/0.49  % new_bool_1 with pid 1357365 completed with status 9
% 0.22/0.49  % sh5l with pid 1357366 completed with status 0
% 0.22/0.49  % Result found by sh5l
% 0.22/0.49  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.22/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.22/0.49  % Starting new_bool_3 with 600s (2) cores
% 0.22/0.49  % Starting new_bool_1 with 600s (2) cores
% 0.22/0.49  % Starting sh5l with 300s (1) cores
% 0.22/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.49  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.49  % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.22/0.49  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.49  % SubtermCWHack with pid 1357393 completed with status 0
% 0.22/0.49  % Result found by SubtermCWHack
% 0.22/0.49  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.22/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.22/0.49  % Starting new_bool_3 with 600s (2) cores
% 0.22/0.49  % Starting new_bool_1 with 600s (2) cores
% 0.22/0.49  % Starting sh5l with 300s (1) cores
% 0.22/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.49  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.49  % Search class: FGHSF-FSLM33-SFFFFFNN
% 0.22/0.49  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.49  % Preprocessing time       : 0.009 s
% 0.22/0.49  
% 0.22/0.49  % Proof found!
% 0.22/0.49  % SZS status Theorem
% 0.22/0.49  % SZS output start CNFRefutation
% See solution above
% 0.22/0.49  % Parsed axioms                        : 560
% 0.22/0.49  % Removed by relevancy pruning/SinE    : 336
% 0.22/0.49  % Initial clauses                      : 608
% 0.22/0.49  % Removed in clause preprocessing      : 0
% 0.22/0.49  % Initial clauses in saturation        : 608
% 0.22/0.49  % Processed clauses                    : 192
% 0.22/0.49  % ...of these trivial                  : 11
% 0.22/0.49  % ...subsumed                          : 4
% 0.22/0.49  % ...remaining for further processing  : 176
% 0.22/0.49  % Other redundant clauses eliminated   : 0
% 0.22/0.49  % Clauses deleted for lack of memory   : 0
% 0.22/0.49  % Backward-subsumed                    : 0
% 0.22/0.49  % Backward-rewritten                   : 1
% 0.22/0.49  % Generated clauses                    : 82
% 0.22/0.49  % ...of the previous two non-redundant : 77
% 0.22/0.49  % ...aggressively subsumed             : 0
% 0.22/0.49  % Contextual simplify-reflections      : 0
% 0.22/0.49  % Paramodulations                      : 82
% 0.22/0.49  % Factorizations                       : 0
% 0.22/0.49  % NegExts                              : 0
% 0.22/0.49  % Equation resolutions                 : 0
% 0.22/0.49  % Disequality decompositions           : 0
% 0.22/0.49  % Total rewrite steps                  : 16
% 0.22/0.49  % ...of those cached                   : 12
% 0.22/0.49  % Propositional unsat checks           : 0
% 0.22/0.49  %    Propositional check models        : 0
% 0.22/0.49  %    Propositional check unsatisfiable : 0
% 0.22/0.49  %    Propositional clauses             : 0
% 0.22/0.49  %    Propositional clauses after purity: 0
% 0.22/0.49  %    Propositional unsat core size     : 0
% 0.22/0.49  %    Propositional preprocessing time  : 0.000
% 0.22/0.49  %    Propositional encoding time       : 0.000
% 0.22/0.49  %    Propositional solver time         : 0.000
% 0.22/0.49  %    Success case prop preproc time    : 0.000
% 0.22/0.49  %    Success case prop encoding time   : 0.000
% 0.22/0.49  %    Success case prop solver time     : 0.000
% 0.22/0.49  % Current number of processed clauses  : 175
% 0.22/0.49  %    Positive orientable unit clauses  : 158
% 0.22/0.49  %    Positive unorientable unit clauses: 0
% 0.22/0.49  %    Negative unit clauses             : 1
% 0.22/0.49  %    Non-unit-clauses                  : 16
% 0.22/0.49  % Current number of unprocessed clauses: 493
% 0.22/0.49  % ...number of literals in the above   : 2899
% 0.22/0.49  % Current number of archived formulas  : 0
% 0.22/0.49  % Current number of archived clauses   : 1
% 0.22/0.49  % Clause-clause subsumption calls (NU) : 48
% 0.22/0.49  % Rec. Clause-clause subsumption calls : 45
% 0.22/0.49  % Non-unit clause-clause subsumptions  : 4
% 0.22/0.49  % Unit Clause-clause subsumption calls : 101
% 0.22/0.49  % Rewrite failures with RHS unbound    : 0
% 0.22/0.49  % BW rewrite match attempts            : 4
% 0.22/0.49  % BW rewrite match successes           : 1
% 0.22/0.49  % Condensation attempts                : 0
% 0.22/0.49  % Condensation successes               : 0
% 0.22/0.49  % Termbank termtop insertions          : 53103
% 0.22/0.49  % Search garbage collected termcells   : 11874
% 0.22/0.49  
% 0.22/0.49  % -------------------------------------------------
% 0.22/0.49  % User time                : 0.044 s
% 0.22/0.49  % System time              : 0.009 s
% 0.22/0.49  % Total time               : 0.053 s
% 0.22/0.49  % Maximum resident set size: 5972 pages
% 0.22/0.49  
% 0.22/0.49  % -------------------------------------------------
% 0.22/0.49  % User time                : 0.092 s
% 0.22/0.49  % System time              : 0.056 s
% 0.22/0.49  % Total time               : 0.147 s
% 0.22/0.49  % Maximum resident set size: 5120 pages
% 0.22/0.49  % E exiting
%------------------------------------------------------------------------------