↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL469+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 : n010.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:53 PM UTC 2026

% Result   : Theorem 0.88s 0.52s
% Output   : CNFRefutation 0.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   26 (  14 unt;   0 def)
%            Number of atoms       :   38 (   6 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  11   ~;   8   |;   0   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   1 sgn   8   !;   0   ?)

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

fof(hilbert_or_1_negated,plain,
    ~ or_1,
    inference(negate_conjecture,[status(cth)],[hilbert_or_1]) ).

cnf(71,plain,
    ~ or_1,
    inference(cnf,[status(esa)],[hilbert_or_1_negated]) ).

cnf(l0,plain,
    ~ or_1,
    inference(instantiation,[status(thm)],[71]) ).

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

cnf(22,plain,
    ( ~ is_a_theorem(implies(sK20,or(sK20,sK21)))
    | or_1 ),
    inference(cnf,[status(esa)],[or_1]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(sK20,or(sK20,sK21)))
    | or_1 ),
    inference(instantiation,[status(thm)],[22]) ).

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(l6,plain,
    ( ~ op_or
    | or(sK20,sK21) = not(and(not(sK20),not(sK21))) ),
    inference(instantiation,[status(thm)],[55]) ).

fof(luka_op_or,plain,
    op_or,
    file('Axioms/LCL006+3.ax',luka_op_or) ).

cnf(60,plain,
    op_or,
    inference(cnf,[status(esa)],[luka_op_or]) ).

cnf(l75,plain,
    op_or,
    inference(instantiation,[status(thm)],[60]) ).

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(l14,plain,
    ( ~ op_implies_and
    | implies(not(sK20),sK21) = not(and(not(sK20),not(sK21))) ),
    inference(instantiation,[status(thm)],[57]) ).

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

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

cnf(l80,plain,
    op_implies_and,
    inference(instantiation,[status(thm)],[69]) ).

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

cnf(41,plain,
    ( ~ cn2
    | is_a_theorem(implies(X0,implies(not(X0),X1))) ),
    inference(cnf,[status(esa)],[cn2]) ).

cnf(l10,plain,
    ( ~ cn2
    | is_a_theorem(implies(sK20,implies(not(sK20),sK21))) ),
    inference(instantiation,[status(thm)],[41]) ).

fof(luka_cn2,plain,
    cn2,
    file('Axioms/LCL006+3.ax',luka_cn2) ).

cnf(65,plain,
    cn2,
    inference(cnf,[status(esa)],[luka_cn2]) ).

cnf(l15,plain,
    cn2,
    inference(instantiation,[status(thm)],[65]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l6,l75,l14,l80,l10,l15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL469+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.10/0.36  % Computer : n010.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 : Fri Sep  4 18:44:23 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.37  % launching worker at depth: 1
% 0.14/0.37  % launching worker at depth: 3
% 0.14/0.37  % launching worker at depth: 7
% 0.14/0.37  % launching worker at depth: 4
% 0.14/0.37  % launching worker at depth: 5
% 0.14/0.37  % launching worker at depth: 6
% 0.14/0.37  % launching worker at depth: 2
% 0.14/0.37  % launching worker at depth: 8
% 0.14/0.37  % launching worker at depth: 9
% 0.14/0.37  % launching worker at depth: 10
% 0.14/0.37  % launching worker at depth: 11
% 0.14/0.44  % launching worker at depth: 12
% 0.88/0.52  % SZS status Theorem for theBenchmark
% 0.88/0.52  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------