↑ Up

hopCoP---0.1.THM-CRf.s

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

% Computer : n002.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:54 PM UTC 2026

% Result   : Theorem 3.46s 0.88s
% Output   : CNFRefutation 3.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   32 (  17 unt;   0 def)
%            Number of atoms       :   47 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   28 (  13   ~;  10   |;   0   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(hilbert_modus_tollens,plain,
    modus_tollens,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_tollens) ).

fof(hilbert_modus_tollens_negated,plain,
    ~ modus_tollens,
    inference(negate_conjecture,[status(cth)],[hilbert_modus_tollens]) ).

cnf(73,plain,
    ~ modus_tollens,
    inference(cnf,[status(esa)],[hilbert_modus_tollens_negated]) ).

cnf(l0,plain,
    ~ modus_tollens,
    inference(instantiation,[status(thm)],[73]) ).

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

cnf(8,plain,
    ( ~ is_a_theorem(implies(implies(not(sK6),not(sK5)),implies(sK5,sK6)))
    | modus_tollens ),
    inference(cnf,[status(esa)],[modus_tollens]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(implies(not(sK6),not(sK5)),implies(sK5,sK6)))
    | modus_tollens ),
    inference(instantiation,[status(thm)],[8]) ).

fof(op_implies_or,plain,
    ( op_implies_or
   => ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
    file('Axioms/LCL006+1.ax',op_implies_or) ).

cnf(58,plain,
    ( ~ op_implies_or
    | implies(X0,X1) = or(not(X0),X1) ),
    inference(cnf,[status(esa)],[op_implies_or]) ).

cnf(l17,plain,
    ( ~ op_implies_or
    | implies(sK5,sK6) = or(not(sK5),sK6) ),
    inference(instantiation,[status(thm)],[58]) ).

fof(principia_op_implies_or,plain,
    op_implies_or,
    file('Axioms/LCL006+4.ax',principia_op_implies_or) ).

cnf(60,plain,
    op_implies_or,
    inference(cnf,[status(esa)],[principia_op_implies_or]) ).

cnf(l23,plain,
    op_implies_or,
    inference(instantiation,[status(thm)],[60]) ).

fof(op_or,plain,
    ( op_or
   => ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
    file('Axioms/LCL006+1.ax',op_or) ).

cnf(55,plain,
    ( ~ op_or
    | or(X0,X1) = not(and(not(X0),not(X1))) ),
    inference(cnf,[status(esa)],[op_or]) ).

cnf(l15,plain,
    ( ~ op_or
    | or(sK6,not(sK5)) = not(and(not(sK6),not(not(sK5)))) ),
    inference(instantiation,[status(thm)],[55]) ).

fof(op_implies_and,plain,
    ( op_implies_and
   => ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
    file('Axioms/LCL006+1.ax',op_implies_and) ).

cnf(57,plain,
    ( ~ op_implies_and
    | implies(X0,X1) = not(and(X0,not(X1))) ),
    inference(cnf,[status(esa)],[op_implies_and]) ).

cnf(l29,plain,
    ( ~ op_implies_and
    | implies(not(sK6),not(sK5)) = not(and(not(sK6),not(not(sK5)))) ),
    inference(instantiation,[status(thm)],[57]) ).

fof(hilbert_op_or,plain,
    op_or,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).

cnf(70,plain,
    op_or,
    inference(cnf,[status(esa)],[hilbert_op_or]) ).

cnf(l21,plain,
    op_or,
    inference(instantiation,[status(thm)],[70]) ).

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

cnf(49,plain,
    ( ~ r3
    | is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
    inference(cnf,[status(esa)],[r3]) ).

cnf(l9,plain,
    ( ~ r3
    | is_a_theorem(implies(or(sK6,not(sK5)),or(not(sK5),sK6))) ),
    inference(instantiation,[status(thm)],[49]) ).

fof(principia_r3,plain,
    r3,
    file('Axioms/LCL006+4.ax',principia_r3) ).

cnf(66,plain,
    r3,
    inference(cnf,[status(esa)],[principia_r3]) ).

cnf(l11,plain,
    r3,
    inference(instantiation,[status(thm)],[66]) ).

fof(hilbert_op_implies_and,plain,
    op_implies_and,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).

cnf(71,plain,
    op_implies_and,
    inference(cnf,[status(esa)],[hilbert_op_implies_and]) ).

cnf(l104,plain,
    op_implies_and,
    inference(instantiation,[status(thm)],[71]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l17,l23,l15,l29,l21,l9,l11,l104]) ).

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