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

% Computer : n019.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:20:12 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    entity: $tType ).

thf(decl_23,type,
    god_like: entity > $o ).

thf(decl_24,type,
    positive_property: ( entity > $o ) > $o ).

thf(decl_25,type,
    esk1_2: ( entity > $o ) > ( entity > $o ) > entity ).

thf(coro1,axiom,
    ~ ( positive_property
      @ ^ [X1: entity] : ( X1 != X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fiJaGJahAS/E---3.1_744056.p',coro1) ).

thf(coro2,axiom,
    ! [X2: entity > $o,X3: entity > $o] :
      ( ( ( positive_property @ X2 )
        & ! [X4: entity] :
            ( ( X2 @ X4 )
           => ( X3 @ X4 ) ) )
     => ( positive_property @ X3 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.fiJaGJahAS/E---3.1_744056.p',coro2) ).

thf(conj_1,conjecture,
    ? [X1: entity] : ( god_like @ X1 ),
    file('/export/starexec/sandbox2/tmp/tmp.fiJaGJahAS/E---3.1_744056.p',conj_1) ).

thf(axiom3,axiom,
    positive_property @ god_like,
    file('/export/starexec/sandbox2/tmp/tmp.fiJaGJahAS/E---3.1_744056.p',axiom3) ).

thf(c_0_4,plain,
    ~ ( positive_property
      @ ^ [Z0: entity] : ( Z0 != Z0 ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[coro1])]) ).

thf(c_0_5,plain,
    ! [X9: entity > $o,X10: entity > $o] :
      ( ( ( X9 @ ( esk1_2 @ X9 @ X10 ) )
        | ~ ( positive_property @ X9 )
        | ( positive_property @ X10 ) )
      & ( ~ ( X10 @ ( esk1_2 @ X9 @ X10 ) )
        | ~ ( positive_property @ X9 )
        | ( positive_property @ X10 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[coro2])])])])]) ).

thf(c_0_6,negated_conjecture,
    ~ ? [X1: entity] : ( god_like @ X1 ),
    inference(assume_negation,[status(cth)],[conj_1]) ).

thf(c_0_7,plain,
    ~ ( positive_property
      @ ^ [Z0: entity] : ( Z0 != Z0 ) ),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

thf(c_0_8,plain,
    ! [X3: entity > $o,X2: entity > $o] :
      ( ( X2 @ ( esk1_2 @ X2 @ X3 ) )
      | ( positive_property @ X3 )
      | ~ ( positive_property @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ? [X14: entity] : ( god_like @ X14 ),
    conj_1 ).

thf(c_0_10,negated_conjecture,
    ! [X12: entity] :
      ~ ( god_like @ X12 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

thf(c_0_11,plain,
    ~ ( positive_property
      @ ^ [Z0: entity] : ( Z0 != Z0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_12,plain,
    ! [X3: entity > $o] :
      ( ( positive_property @ X3 )
      | ( god_like @ ( esk1_2 @ god_like @ X3 ) )
      | ~ ( positive_property @ god_like ) ),
    inference(trigger,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_13,plain,
    positive_property @ god_like,
    inference(split_conjunct,[status(thm)],[axiom3]) ).

thf(c_0_14,negated_conjecture,
    ! [X1: entity] :
      ~ ( god_like @ X1 ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_15,plain,
    ~ ( positive_property
      @ ^ [Z0: entity] : ( Z0 != Z0 ) ),
    inference(cn,[status(thm)],[c_0_11]) ).

thf(c_0_16,plain,
    ! [X2: entity > $o] : ( positive_property @ X2 ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14]) ).

thf(c_0_17,plain,
    $false,
    inference(spm,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PHI045^6 : TPTP v9.3.1. Released v9.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n019.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 13:20:18 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running higher-order theorem proving
% 0.09/0.25  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.fiJaGJahAS/E---3.1_744056.p
% 0.09/0.27  % Version: 3.5.1-ho
% 0.09/0.27  % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.09/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27  % Starting new_ho_14 with 1500s (5) cores
% 0.09/0.27  % Starting full_lambda_8 with 300s (1) cores
% 0.09/0.27  % Starting new_ho_13 with 300s (1) cores
% 0.09/0.27  % Starting ho_unfolding_3 with 300s (1) cores
% 0.09/0.27  % new_ho_13 with pid 744071 completed with status 0
% 0.09/0.27  % Result found by new_ho_13
% 0.09/0.27  % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.09/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27  % Starting new_ho_14 with 1500s (5) cores
% 0.09/0.27  % Starting full_lambda_8 with 300s (1) cores
% 0.09/0.27  % Starting new_ho_13 with 300s (1) cores
% 0.09/0.27  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.27  % No SInE strategy applied
% 0.09/0.27  % Search class: HGUNF-FFSF22-MSFFFSBN
% 0.09/0.27  % partial match(2): HGUNF-FFSF32-MSSFFSBN
% 0.09/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.27  % SubtermCWHack with pid 744073 completed with status 0
% 0.09/0.27  % Result found by SubtermCWHack
% 0.09/0.27  % Preprocessing class: HSSSSMSSSSSNSFA.
% 0.09/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.27  % Starting new_ho_14 with 1500s (5) cores
% 0.09/0.27  % Starting full_lambda_8 with 300s (1) cores
% 0.09/0.27  % Starting new_ho_13 with 300s (1) cores
% 0.09/0.27  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.27  % No SInE strategy applied
% 0.09/0.27  % Search class: HGUNF-FFSF22-MSFFFSBN
% 0.09/0.27  % partial match(2): HGUNF-FFSF32-MSSFFSBN
% 0.09/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.27  % Preprocessing time       : 0.001 s
% 0.09/0.27  
% 0.09/0.27  % Proof found!
% 0.09/0.27  % SZS status Theorem
% 0.09/0.27  % SZS output start CNFRefutation
% See solution above
% 0.09/0.27  % Parsed axioms                        : 7
% 0.09/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.27  % Initial clauses                      : 8
% 0.09/0.27  % Removed in clause preprocessing      : 3
% 0.09/0.27  % Initial clauses in saturation        : 9
% 0.09/0.27  % Processed clauses                    : 4
% 0.09/0.27  % ...of these trivial                  : 0
% 0.09/0.27  % ...subsumed                          : 0
% 0.09/0.27  % ...remaining for further processing  : 4
% 0.09/0.27  % Other redundant clauses eliminated   : 0
% 0.09/0.27  % Clauses deleted for lack of memory   : 0
% 0.09/0.27  % Backward-subsumed                    : 0
% 0.09/0.27  % Backward-rewritten                   : 1
% 0.09/0.27  % Generated clauses                    : 1
% 0.09/0.27  % ...of the previous two non-redundant : 0
% 0.09/0.27  % ...aggressively subsumed             : 0
% 0.09/0.27  % Contextual simplify-reflections      : 0
% 0.09/0.27  % Paramodulations                      : 1
% 0.09/0.27  % Factorizations                       : 0
% 0.09/0.27  % NegExts                              : 0
% 0.09/0.27  % Equation resolutions                 : 0
% 0.09/0.27  % Disequality decompositions           : 0
% 0.09/0.27  % Total rewrite steps                  : 2
% 0.09/0.27  % ...of those cached                   : 0
% 0.09/0.27  % Propositional unsat checks           : 0
% 0.09/0.27  %    Propositional check models        : 0
% 0.09/0.27  %    Propositional check unsatisfiable : 0
% 0.09/0.27  %    Propositional clauses             : 0
% 0.09/0.27  %    Propositional clauses after purity: 0
% 0.09/0.27  %    Propositional unsat core size     : 0
% 0.09/0.27  %    Propositional preprocessing time  : 0.000
% 0.09/0.27  %    Propositional encoding time       : 0.000
% 0.09/0.27  %    Propositional solver time         : 0.000
% 0.09/0.27  %    Success case prop preproc time    : 0.000
% 0.09/0.27  %    Success case prop encoding time   : 0.000
% 0.09/0.27  %    Success case prop solver time     : 0.000
% 0.09/0.27  % Current number of processed clauses  : 3
% 0.09/0.27  %    Positive orientable unit clauses  : 1
% 0.09/0.27  %    Positive unorientable unit clauses: 0
% 0.09/0.27  %    Negative unit clauses             : 2
% 0.09/0.27  %    Non-unit-clauses                  : 0
% 0.09/0.27  % Current number of unprocessed clauses: 5
% 0.09/0.27  % ...number of literals in the above   : 15
% 0.09/0.27  % Current number of archived formulas  : 0
% 0.09/0.27  % Current number of archived clauses   : 2
% 0.09/0.27  % Clause-clause subsumption calls (NU) : 0
% 0.09/0.27  % Rec. Clause-clause subsumption calls : 0
% 0.09/0.27  % Non-unit clause-clause subsumptions  : 0
% 0.09/0.27  % Unit Clause-clause subsumption calls : 0
% 0.09/0.27  % Rewrite failures with RHS unbound    : 0
% 0.09/0.27  % BW rewrite match attempts            : 2
% 0.09/0.27  % BW rewrite match successes           : 1
% 0.09/0.27  % Condensation attempts                : 0
% 0.09/0.27  % Condensation successes               : 0
% 0.09/0.27  % Termbank termtop insertions          : 461
% 0.09/0.27  % Search garbage collected termcells   : 88
% 0.09/0.27  
% 0.09/0.27  % -------------------------------------------------
% 0.09/0.27  % User time                : 0.003 s
% 0.09/0.27  % System time              : 0.001 s
% 0.09/0.27  % Total time               : 0.004 s
% 0.09/0.27  % Maximum resident set size: 3632 pages
% 0.09/0.27  
% 0.09/0.27  % -------------------------------------------------
% 0.09/0.27  % User time                : 0.004 s
% 0.09/0.27  % System time              : 0.005 s
% 0.09/0.27  % Total time               : 0.009 s
% 0.09/0.27  % Maximum resident set size: 4864 pages
% 0.09/0.27  % E exiting
%------------------------------------------------------------------------------