↑ 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  : SYO501^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.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 : Wed Sep 30 08:44:42 AM UTC 2026

% Result   : Theorem 0.08s 0.25s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   2 unt;   0 typ;   0 def)
%            Number of atoms       :   54 (   0 equ;   0 cnn)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  105 (  24   ~;  17   |;   7   &;  57   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    x: $i ).

thf(decl_24,type,
    y: $o ).

thf(decl_25,type,
    f: $i > $o > $i ).

thf(decl_26,type,
    p: $i > $o ).

thf(claim,conjecture,
    ( ~ ( p
        @ ( f @ x
          @ ~ ~ y ) )
    | ( p @ ( f @ x @ y ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Sy95YJTE9q/E---3.1_637420.p',claim) ).

thf(c_0_1,negated_conjecture,
    ~ ( ~ ( p
          @ ( f @ x
            @ ~ ~ y ) )
      | ( p @ ( f @ x @ y ) ) ),
    inference(assume_negation,[status(cth)],[claim]) ).

thf(c_0_2,negated_conjecture,
    ~ ( ~ ( ( ~ y
            | ( p @ ( f @ x @ $true ) ) )
          & ( y
            | ( p @ ( f @ x @ $false ) ) ) )
      | ( ( ~ y
          | ( p @ ( f @ x @ $true ) ) )
        & ( y
          | ( p @ ( f @ x @ $false ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_1])]) ).

thf(c_0_3,negated_conjecture,
    ( ( ~ y
      | ( p @ ( f @ x @ $true ) ) )
    & ( y
      | ( p @ ( f @ x @ $false ) ) )
    & ( ~ y
      | y )
    & ( ~ ( p @ ( f @ x @ $false ) )
      | y )
    & ( ~ y
      | ~ ( p @ ( f @ x @ $true ) ) )
    & ( ~ ( p @ ( f @ x @ $false ) )
      | ~ ( p @ ( f @ x @ $true ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

thf(c_0_4,negated_conjecture,
    ( y
    | ~ ( p @ ( f @ x @ ~ $true ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( y
    | ( p @ ( f @ x @ ~ $true ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ( ( p @ ( f @ x @ $true ) )
    | ~ y ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_7,negated_conjecture,
    y,
    inference(csr,[status(thm)],[c_0_4,c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ( ~ y
    | ~ ( p @ ( f @ x @ $true ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_9,negated_conjecture,
    p @ ( f @ x @ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

thf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO501^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n016.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 17:16:19 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Sy95YJTE9q/E---3.1_637420.p
% 0.08/0.25  % Version: 3.5.1-ho
% 0.08/0.25  % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25  % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25  % Starting sh4l with 300s (1) cores
% 0.08/0.25  % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.08/0.25  % ho_unfolding_6 with pid 637434 completed with status 0
% 0.08/0.25  % Result found by ho_unfolding_6
% 0.08/0.25  % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25  % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25  % No SInE strategy applied
% 0.08/0.25  % Search class: HGHNF-FFSF22-SFFFFFNN
% 0.08/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25  % SubtermCWHack with pid 637438 completed with status 0
% 0.08/0.25  % Result found by SubtermCWHack
% 0.08/0.25  % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.25  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.25  % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.25  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.25  % No SInE strategy applied
% 0.08/0.25  % Search class: HGHNF-FFSF22-SFFFFFNN
% 0.08/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.25  % Preprocessing time       : 0.001 s
% 0.08/0.25  
% 0.08/0.25  % Proof found!
% 0.08/0.25  % SZS status Theorem
% 0.08/0.25  % SZS output start CNFRefutation
% See solution above
% 0.08/0.25  % Parsed axioms                        : 5
% 0.08/0.25  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.25  % Initial clauses                      : 10
% 0.08/0.25  % Removed in clause preprocessing      : 5
% 0.08/0.25  % Initial clauses in saturation        : 5
% 0.08/0.25  % Processed clauses                    : 5
% 0.08/0.25  % ...of these trivial                  : 0
% 0.08/0.25  % ...subsumed                          : 0
% 0.08/0.25  % ...remaining for further processing  : 4
% 0.08/0.25  % Other redundant clauses eliminated   : 0
% 0.08/0.25  % Clauses deleted for lack of memory   : 0
% 0.08/0.25  % Backward-subsumed                    : 0
% 0.08/0.25  % Backward-rewritten                   : 2
% 0.08/0.25  % Generated clauses                    : 0
% 0.08/0.25  % ...of the previous two non-redundant : 1
% 0.08/0.25  % ...aggressively subsumed             : 0
% 0.08/0.25  % Contextual simplify-reflections      : 1
% 0.08/0.25  % Paramodulations                      : 0
% 0.08/0.25  % Factorizations                       : 0
% 0.08/0.25  % NegExts                              : 0
% 0.08/0.25  % Equation resolutions                 : 0
% 0.08/0.25  % Disequality decompositions           : 0
% 0.08/0.25  % Total rewrite steps                  : 4
% 0.08/0.25  % ...of those cached                   : 2
% 0.08/0.25  % Propositional unsat checks           : 0
% 0.08/0.25  %    Propositional check models        : 0
% 0.08/0.25  %    Propositional check unsatisfiable : 0
% 0.08/0.25  %    Propositional clauses             : 0
% 0.08/0.25  %    Propositional clauses after purity: 0
% 0.08/0.25  %    Propositional unsat core size     : 0
% 0.08/0.25  %    Propositional preprocessing time  : 0.000
% 0.08/0.25  %    Propositional encoding time       : 0.000
% 0.08/0.25  %    Propositional solver time         : 0.000
% 0.08/0.25  %    Success case prop preproc time    : 0.000
% 0.08/0.25  %    Success case prop encoding time   : 0.000
% 0.08/0.25  %    Success case prop solver time     : 0.000
% 0.08/0.25  % Current number of processed clauses  : 2
% 0.08/0.25  %    Positive orientable unit clauses  : 2
% 0.08/0.25  %    Positive unorientable unit clauses: 0
% 0.08/0.25  %    Negative unit clauses             : 0
% 0.08/0.25  %    Non-unit-clauses                  : 0
% 0.08/0.25  % Current number of unprocessed clauses: 1
% 0.08/0.25  % ...number of literals in the above   : 2
% 0.08/0.25  % Current number of archived formulas  : 0
% 0.08/0.25  % Current number of archived clauses   : 2
% 0.08/0.25  % Clause-clause subsumption calls (NU) : 1
% 0.08/0.25  % Rec. Clause-clause subsumption calls : 1
% 0.08/0.25  % Non-unit clause-clause subsumptions  : 1
% 0.08/0.25  % Unit Clause-clause subsumption calls : 0
% 0.08/0.25  % Rewrite failures with RHS unbound    : 0
% 0.08/0.25  % BW rewrite match attempts            : 1
% 0.08/0.25  % BW rewrite match successes           : 1
% 0.08/0.25  % Condensation attempts                : 0
% 0.08/0.25  % Condensation successes               : 0
% 0.08/0.25  % Termbank termtop insertions          : 374
% 0.08/0.25  % Search garbage collected termcells   : 32
% 0.08/0.25  
% 0.08/0.25  % -------------------------------------------------
% 0.08/0.25  % User time                : 0.002 s
% 0.08/0.25  % System time              : 0.002 s
% 0.08/0.25  % Total time               : 0.004 s
% 0.08/0.25  % Maximum resident set size: 3576 pages
% 0.08/0.25  
% 0.08/0.25  % -------------------------------------------------
% 0.08/0.25  % User time                : 0.003 s
% 0.08/0.25  % System time              : 0.008 s
% 0.08/0.25  % Total time               : 0.010 s
% 0.08/0.25  % Maximum resident set size: 4864 pages
% 0.08/0.25  % E exiting
%------------------------------------------------------------------------------