↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n009.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 : Mon Sep  7 12:13:51 PM UTC 2026

% Result   : Theorem 0.11s 0.40s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (  20 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   52 (  24   ~;  21   |;   1   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    7 (   6 usr;   6 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   19 (   1 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(principia_r1,plain,
    r1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).

fof(principia_r1_negated,plain,
    ~ r1,
    inference(negate_conjecture,[status(cth)],[principia_r1]) ).

cnf(81,plain,
    ~ r1,
    inference(cnf,[status(esa)],[principia_r1_negated]) ).

cnf(l0,plain,
    ~ r1,
    inference(instantiation,[status(thm)],[81]) ).

fof(r1,plain,
    ( r1
  <=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
    file('Axioms/LCL006+0.ax',r1) ).

cnf(46,plain,
    ( ~ is_a_theorem(implies(or(sK45,sK45),sK45))
    | r1 ),
    inference(cnf,[status(esa)],[r1]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(or(sK45,sK45),sK45))
    | r1 ),
    inference(instantiation,[status(thm)],[46]) ).

fof(modus_ponens,plain,
    ( modus_ponens
  <=> ! [X,Y] :
        ( ( is_a_theorem(X)
          & is_a_theorem(implies(X,Y)) )
       => is_a_theorem(Y) ) ),
    file('Axioms/LCL006+0.ax',modus_ponens) ).

cnf(0,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(X0)
    | ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(X1) ),
    inference(cnf,[status(esa)],[modus_ponens]) ).

cnf(l2,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(sK45,sK45))
    | ~ is_a_theorem(implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45)))
    | is_a_theorem(implies(or(sK45,sK45),sK45)) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l5,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(implies(sK45,sK45),implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45))))
    | ~ is_a_theorem(implies(implies(implies(sK45,sK45),implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45))),implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45))))
    | is_a_theorem(implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45))) ),
    inference(instantiation,[status(thm)],[0]) ).

fof(hilbert_modus_ponens,plain,
    modus_ponens,
    file('Axioms/LCL006+2.ax',hilbert_modus_ponens) ).

cnf(63,plain,
    modus_ponens,
    inference(cnf,[status(esa)],[hilbert_modus_ponens]) ).

cnf(l3,plain,
    modus_ponens,
    inference(instantiation,[status(thm)],[63]) ).

cnf(l7,plain,
    modus_ponens,
    inference(instantiation,[status(thm)],[63]) ).

fof(implies_2,plain,
    ( implies_2
  <=> ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) ),
    file('Axioms/LCL006+0.ax',implies_2) ).

cnf(11,plain,
    ( ~ implies_2
    | is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
    inference(cnf,[status(esa)],[implies_2]) ).

cnf(l8,plain,
    ( ~ implies_2
    | is_a_theorem(implies(implies(implies(sK45,sK45),implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45))),implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45)))) ),
    inference(instantiation,[status(thm)],[11]) ).

fof(hilbert_implies_2,plain,
    implies_2,
    file('Axioms/LCL006+2.ax',hilbert_implies_2) ).

cnf(66,plain,
    implies_2,
    inference(cnf,[status(esa)],[hilbert_implies_2]) ).

cnf(l18,plain,
    implies_2,
    inference(instantiation,[status(thm)],[66]) ).

fof(or_3,plain,
    ( or_3
  <=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) ),
    file('Axioms/LCL006+0.ax',or_3) ).

cnf(25,plain,
    ( ~ or_3
    | is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))) ),
    inference(cnf,[status(esa)],[or_3]) ).

cnf(l9,plain,
    ( ~ or_3
    | is_a_theorem(implies(implies(sK45,sK45),implies(implies(sK45,sK45),implies(or(sK45,sK45),sK45)))) ),
    inference(instantiation,[status(thm)],[25]) ).

cnf(l4,plain,
    ( ~ modus_ponens
    | ~ is_a_theorem(implies(sK45,implies(sK45,sK45)))
    | ~ is_a_theorem(implies(implies(sK45,implies(sK45,sK45)),implies(sK45,sK45)))
    | is_a_theorem(implies(sK45,sK45)) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l22,plain,
    ( ~ implies_2
    | is_a_theorem(implies(implies(sK45,implies(sK45,sK45)),implies(sK45,sK45))) ),
    inference(instantiation,[status(thm)],[11]) ).

cnf(l6,plain,
    modus_ponens,
    inference(instantiation,[status(thm)],[63]) ).

fof(hilbert_or_3,plain,
    or_3,
    file('Axioms/LCL006+2.ax',hilbert_or_3) ).

cnf(73,plain,
    or_3,
    inference(cnf,[status(esa)],[hilbert_or_3]) ).

cnf(l10,plain,
    or_3,
    inference(instantiation,[status(thm)],[73]) ).

fof(implies_1,plain,
    ( implies_1
  <=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
    file('Axioms/LCL006+0.ax',implies_1) ).

cnf(9,plain,
    ( ~ implies_1
    | is_a_theorem(implies(X0,implies(X1,X0))) ),
    inference(cnf,[status(esa)],[implies_1]) ).

cnf(l20,plain,
    ( ~ implies_1
    | is_a_theorem(implies(sK45,implies(sK45,sK45))) ),
    inference(instantiation,[status(thm)],[9]) ).

cnf(l24,plain,
    implies_2,
    inference(instantiation,[status(thm)],[66]) ).

fof(hilbert_implies_1,plain,
    implies_1,
    file('Axioms/LCL006+2.ax',hilbert_implies_1) ).

cnf(65,plain,
    implies_1,
    inference(cnf,[status(esa)],[hilbert_implies_1]) ).

cnf(l26,plain,
    implies_1,
    inference(instantiation,[status(thm)],[65]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l5,l3,l7,l8,l18,l9,l4,l22,l6,l10,l20,l24,l26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n009.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep  5 21:40:51 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % launching worker at depth: 1
% 0.11/0.38  % launching worker at depth: 6
% 0.11/0.38  % launching worker at depth: 3
% 0.11/0.38  % launching worker at depth: 4
% 0.11/0.38  % launching worker at depth: 5
% 0.11/0.38  % launching worker at depth: 7
% 0.11/0.38  % launching worker at depth: 2
% 0.11/0.38  % launching worker at depth: 8
% 0.11/0.38  % launching worker at depth: 9
% 0.11/0.38  % launching worker at depth: 10
% 0.11/0.38  % launching worker at depth: 11
% 0.11/0.40  % SZS status Theorem for theBenchmark
% 0.11/0.40  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------