↑ 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  : SYO549^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 : n006.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:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    p: ( $o > $o ) > ( $o > $o ) > $o ).

thf(decl_24,type,
    f: $o > $o ).

thf(decl_25,type,
    g: $o > $o ).

thf(pfgc,conjecture,
    ( p @ f
    @ ^ [X1: $o] :
        ( g
        @ ~ ~ X1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.kPINSo7NBF/E---3.1_1040716.p',pfgc) ).

thf(pfg,axiom,
    ( p
    @ ^ [X1: $o] :
        ( f
        @ ~ ~ X1 )
    @ g ),
    file('/export/starexec/sandbox/tmp/tmp.kPINSo7NBF/E---3.1_1040716.p',pfg) ).

thf(c_0_2,negated_conjecture,
    ~ ( p @ f
      @ ^ [X1: $o] :
          ( g
          @ ~ ~ X1 ) ),
    inference(assume_negation,[status(cth)],[pfgc]) ).

thf(c_0_3,negated_conjecture,
    ~ ( p @ f
      @ ^ [Z0: $o] :
          ( g
          @ ~ ~ Z0 ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])]) ).

thf(c_0_4,plain,
    ( p
    @ ^ [Z0: $o] :
        ( f
        @ ~ ~ Z0 )
    @ g ),
    inference(fof_simplification,[status(thm)],[pfg]) ).

thf(c_0_5,negated_conjecture,
    ~ ( p @ f
      @ ^ [Z0: $o] :
          ( g
          @ ~ ~ Z0 ) ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

thf(c_0_6,plain,
    ( p
    @ ^ [Z0: $o] :
        ( f
        @ ~ ~ Z0 )
    @ g ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ~ ( p @ f
      @ ^ [Z0: $o] :
          ( g
          @ ~ ~ Z0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_8,plain,
    ( p
    @ ^ [Z0: $o] : ( f @ Z0 )
    @ g ),
    inference(cn,[status(thm)],[c_0_6]) ).

thf(c_0_9,negated_conjecture,
    ~ ( p @ f
      @ ^ [Z0: $o] : ( g @ Z0 ) ),
    inference(cn,[status(thm)],[c_0_7]) ).

thf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[c_0_8,c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO549^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n006.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 17:14:09 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running higher-order theorem proving
% 0.07/0.24  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.kPINSo7NBF/E---3.1_1040716.p
% 0.22/0.27  % Version: 3.5.1-ho
% 0.22/0.27  % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting sh3 with 1500s (5) cores
% 0.22/0.27  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.27  % Starting sh2lt with 300s (1) cores
% 0.22/0.27  % Starting ho_unfolding_1 with 300s (1) cores
% 0.22/0.27  % ehoh_best8_lambda with pid 1040730 completed with status 0
% 0.22/0.27  % Result found by ehoh_best8_lambda
% 0.22/0.27  % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting sh3 with 1500s (5) cores
% 0.22/0.27  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.22/0.27  % No SInE strategy applied
% 0.22/0.27  % Search class: HUUNF-FFSF00-MSSFFFNN
% 0.22/0.27  % partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.22/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27  % SubtermCWHack with pid 1040734 completed with status 0
% 0.22/0.27  % Result found by SubtermCWHack
% 0.22/0.27  % Preprocessing class: HSSSSMSSSSMNSSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting sh3 with 1500s (5) cores
% 0.22/0.27  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.22/0.27  % No SInE strategy applied
% 0.22/0.27  % Search class: HUUNF-FFSF00-MSSFFFNN
% 0.22/0.27  % partial match(1): HUUNF-FFSF00-SSSFFFNN
% 0.22/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.27  % Preprocessing time       : 0.001 s
% 0.22/0.27  
% 0.22/0.27  % Proof found!
% 0.22/0.27  % SZS status Theorem
% 0.22/0.27  % SZS output start CNFRefutation
% See solution above
% 0.22/0.27  % Parsed axioms                        : 5
% 0.22/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.27  % Initial clauses                      : 5
% 0.22/0.27  % Removed in clause preprocessing      : 3
% 0.22/0.27  % Initial clauses in saturation        : 2
% 0.22/0.27  % Processed clauses                    : 2
% 0.22/0.27  % ...of these trivial                  : 0
% 0.22/0.27  % ...subsumed                          : 0
% 0.22/0.27  % ...remaining for further processing  : 2
% 0.22/0.27  % Other redundant clauses eliminated   : 0
% 0.22/0.27  % Clauses deleted for lack of memory   : 0
% 0.22/0.27  % Backward-subsumed                    : 0
% 0.22/0.27  % Backward-rewritten                   : 0
% 0.22/0.27  % Generated clauses                    : 1
% 0.22/0.27  % ...of the previous two non-redundant : 0
% 0.22/0.27  % ...aggressively subsumed             : 0
% 0.22/0.27  % Contextual simplify-reflections      : 0
% 0.22/0.27  % Paramodulations                      : 0
% 0.22/0.27  % Factorizations                       : 0
% 0.22/0.27  % NegExts                              : 0
% 0.22/0.27  % Equation resolutions                 : 0
% 0.22/0.27  % Disequality decompositions           : 0
% 0.22/0.27  % Total rewrite steps                  : 0
% 0.22/0.27  % ...of those cached                   : 0
% 0.22/0.27  % Propositional unsat checks           : 0
% 0.22/0.27  %    Propositional check models        : 0
% 0.22/0.27  %    Propositional check unsatisfiable : 0
% 0.22/0.27  %    Propositional clauses             : 0
% 0.22/0.27  %    Propositional clauses after purity: 0
% 0.22/0.27  %    Propositional unsat core size     : 0
% 0.22/0.27  %    Propositional preprocessing time  : 0.000
% 0.22/0.27  %    Propositional encoding time       : 0.000
% 0.22/0.27  %    Propositional solver time         : 0.000
% 0.22/0.27  %    Success case prop preproc time    : 0.000
% 0.22/0.27  %    Success case prop encoding time   : 0.000
% 0.22/0.27  %    Success case prop solver time     : 0.000
% 0.22/0.27  % Current number of processed clauses  : 1
% 0.22/0.27  %    Positive orientable unit clauses  : 0
% 0.22/0.27  %    Positive unorientable unit clauses: 0
% 0.22/0.27  %    Negative unit clauses             : 1
% 0.22/0.27  %    Non-unit-clauses                  : 0
% 0.22/0.27  % Current number of unprocessed clauses: 0
% 0.22/0.27  % ...number of literals in the above   : 0
% 0.22/0.27  % Current number of archived formulas  : 0
% 0.22/0.27  % Current number of archived clauses   : 1
% 0.22/0.27  % Clause-clause subsumption calls (NU) : 0
% 0.22/0.27  % Rec. Clause-clause subsumption calls : 0
% 0.22/0.27  % Non-unit clause-clause subsumptions  : 0
% 0.22/0.27  % Unit Clause-clause subsumption calls : 0
% 0.22/0.27  % Rewrite failures with RHS unbound    : 0
% 0.22/0.27  % BW rewrite match attempts            : 0
% 0.22/0.27  % BW rewrite match successes           : 0
% 0.22/0.27  % Condensation attempts                : 0
% 0.22/0.27  % Condensation successes               : 0
% 0.22/0.27  % Termbank termtop insertions          : 279
% 0.22/0.27  % Search garbage collected termcells   : 19
% 0.22/0.27  
% 0.22/0.27  % -------------------------------------------------
% 0.22/0.27  % User time                : 0.004 s
% 0.22/0.27  % System time              : 0.000 s
% 0.22/0.27  % Total time               : 0.004 s
% 0.22/0.27  % Maximum resident set size: 3628 pages
% 0.22/0.27  
% 0.22/0.27  % -------------------------------------------------
% 0.22/0.27  % User time                : 0.005 s
% 0.22/0.27  % System time              : 0.005 s
% 0.22/0.27  % Total time               : 0.010 s
% 0.22/0.27  % Maximum resident set size: 4864 pages
% 0.22/0.27  % E exiting
%------------------------------------------------------------------------------