↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/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 01:16:07 PM UTC 2026

% Result   : Theorem 0.14s 0.42s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  101 (  56   ~;  41   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   29 (   1 sgn  16   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ ! [X1] :
                      ( ~ ! [X2] :
                            ( p1(X2)
                            | ~ r1(X1,X2) )
                      | ! [X2] :
                          ( p1(X2)
                          | ~ r1(X1,X2) )
                      | ~ r1(X2,X1) )
                | ~ $true
                | ~ r1(X1,X2) )
          | ~ $true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

fof(reflexivity,axiom,
    ! [X1] : r1(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

fof(c_0_2,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ ! [X1] :
                        ( ~ ! [X2] :
                              ( p1(X2)
                              | ~ r1(X1,X2) )
                        | ! [X2] :
                            ( p1(X2)
                            | ~ r1(X1,X2) )
                        | ~ r1(X2,X1) )
                  | ~ $true
                  | ~ r1(X1,X2) )
            | ~ $true ),
    inference(assume_negation,[status(cth)],[main]) ).

fof(c_0_3,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ ! [X1] :
                        ( ~ ! [X2] :
                              ( p1(X2)
                              | ~ r1(X1,X2) )
                        | ! [X2] :
                            ( p1(X2)
                            | ~ r1(X1,X2) )
                        | ~ r1(X2,X1) )
                  | ~ $true
                  | ~ r1(X1,X2) )
            | ~ $true ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_4,negated_conjecture,
    ! [X5,X8] :
      ( ( ~ $true
        | ~ r1(esk1_0,X5)
        | p1(X8)
        | ~ r1(esk2_1(X5),X8) )
      & ( ~ $true
        | ~ r1(esk1_0,X5)
        | ~ p1(esk3_1(X5)) )
      & ( ~ $true
        | ~ r1(esk1_0,X5)
        | r1(esk2_1(X5),esk3_1(X5)) )
      & ( ~ $true
        | ~ r1(esk1_0,X5)
        | r1(X5,esk2_1(X5)) )
      & $true ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).

cnf(c_0_5,negated_conjecture,
    ( $false
    | ~ r1(esk1_0,X1)
    | ~ r1(esk2_1(X1),X2)
    | p1(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,negated_conjecture,
    ( $false
    | ~ r1(esk1_0,X1)
    | r1(esk2_1(X1),esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( $false
    | ~ r1(esk1_0,X1)
    | ~ p1(esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ r1(esk2_1(X1),X2)
    | ~ r1(esk1_0,X1)
    | p1(X2) ),
    inference(cn,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | r1(esk2_1(X1),esk3_1(X1)) ),
    inference(cn,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ p1(esk3_1(X1)) ),
    inference(cn,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X9] : r1(X9,X9),
    inference(variable_rename,[status(thm)],[reflexivity]) ).

cnf(c_0_12,negated_conjecture,
    ~ r1(esk1_0,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_13,plain,
    r1(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_12,c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n011.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 00:54:55 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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.14/0.42  % Version: 3.5.1
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42  % Starting sh5l with 300s (1) cores
% 0.14/0.42  % new_bool_3 with pid 612740 completed with status 0
% 0.14/0.42  % Result found by new_bool_3
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42  % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.14/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.42  % SubtermCWHack with pid 612749 completed with status 0
% 0.14/0.42  % Result found by SubtermCWHack
% 0.14/0.42  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.42  % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.14/0.42  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.42  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.42  % Preprocessing time       : 0.001 s
% 0.14/0.42  
% 0.14/0.42  % Proof found!
% 0.14/0.42  % SZS status Theorem
% 0.14/0.42  % SZS output start CNFRefutation
% See solution above
% 0.14/0.42  % Parsed axioms                        : 3
% 0.14/0.42  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.42  % Initial clauses                      : 7
% 0.14/0.42  % Removed in clause preprocessing      : 1
% 0.14/0.42  % Initial clauses in saturation        : 6
% 0.14/0.42  % Processed clauses                    : 7
% 0.14/0.42  % ...of these trivial                  : 0
% 0.14/0.42  % ...subsumed                          : 0
% 0.14/0.42  % ...remaining for further processing  : 7
% 0.14/0.42  % Other redundant clauses eliminated   : 0
% 0.14/0.42  % Clauses deleted for lack of memory   : 0
% 0.14/0.42  % Backward-subsumed                    : 5
% 0.14/0.42  % Backward-rewritten                   : 0
% 0.14/0.42  % Generated clauses                    : 4
% 0.14/0.42  % ...of the previous two non-redundant : 3
% 0.14/0.42  % ...aggressively subsumed             : 0
% 0.14/0.42  % Contextual simplify-reflections      : 1
% 0.14/0.42  % Paramodulations                      : 4
% 0.14/0.42  % Factorizations                       : 0
% 0.14/0.42  % NegExts                              : 0
% 0.14/0.42  % Equation resolutions                 : 0
% 0.14/0.42  % Disequality decompositions           : 0
% 0.14/0.42  % Total rewrite steps                  : 0
% 0.14/0.42  % ...of those cached                   : 0
% 0.14/0.42  % Propositional unsat checks           : 0
% 0.14/0.42  %    Propositional check models        : 0
% 0.14/0.42  %    Propositional check unsatisfiable : 0
% 0.14/0.42  %    Propositional clauses             : 0
% 0.14/0.42  %    Propositional clauses after purity: 0
% 0.14/0.42  %    Propositional unsat core size     : 0
% 0.14/0.42  %    Propositional preprocessing time  : 0.000
% 0.14/0.42  %    Propositional encoding time       : 0.000
% 0.14/0.42  %    Propositional solver time         : 0.000
% 0.14/0.42  %    Success case prop preproc time    : 0.000
% 0.14/0.42  %    Success case prop encoding time   : 0.000
% 0.14/0.42  %    Success case prop solver time     : 0.000
% 0.14/0.42  % Current number of processed clauses  : 2
% 0.14/0.42  %    Positive orientable unit clauses  : 1
% 0.14/0.42  %    Positive unorientable unit clauses: 0
% 0.14/0.42  %    Negative unit clauses             : 1
% 0.14/0.42  %    Non-unit-clauses                  : 0
% 0.14/0.42  % Current number of unprocessed clauses: 2
% 0.14/0.42  % ...number of literals in the above   : 6
% 0.14/0.42  % Current number of archived formulas  : 0
% 0.14/0.42  % Current number of archived clauses   : 5
% 0.14/0.42  % Clause-clause subsumption calls (NU) : 3
% 0.14/0.42  % Rec. Clause-clause subsumption calls : 3
% 0.14/0.42  % Non-unit clause-clause subsumptions  : 1
% 0.14/0.42  % Unit Clause-clause subsumption calls : 5
% 0.14/0.42  % Rewrite failures with RHS unbound    : 0
% 0.14/0.42  % BW rewrite match attempts            : 0
% 0.14/0.42  % BW rewrite match successes           : 0
% 0.14/0.42  % Condensation attempts                : 0
% 0.14/0.42  % Condensation successes               : 0
% 0.14/0.42  % Termbank termtop insertions          : 544
% 0.14/0.42  % Search garbage collected termcells   : 110
% 0.14/0.42  
% 0.14/0.42  % -------------------------------------------------
% 0.14/0.42  % User time                : 0.003 s
% 0.14/0.42  % System time              : 0.002 s
% 0.14/0.42  % Total time               : 0.005 s
% 0.14/0.42  % Maximum resident set size: 3628 pages
% 0.14/0.42  
% 0.14/0.42  % -------------------------------------------------
% 0.14/0.42  % User time                : 0.003 s
% 0.14/0.42  % System time              : 0.009 s
% 0.14/0.42  % Total time               : 0.012 s
% 0.14/0.42  % Maximum resident set size: 4864 pages
% 0.14/0.42  % E exiting
%------------------------------------------------------------------------------