↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : LCL452+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 : n013.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.96s 0.49s
% Output   : CNFRefutation 0.96s
% 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(luka_cn2,plain,
    cn2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).

fof(luka_cn2_negated,plain,
    ~ cn2,
    inference(negate_conjecture,[status(cth)],[luka_cn2]) ).

cnf(81,plain,
    ~ cn2,
    inference(cnf,[status(esa)],[luka_cn2_negated]) ).

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

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

cnf(42,plain,
    ( ~ is_a_theorem(implies(sK42,implies(not(sK42),sK43)))
    | cn2 ),
    inference(cnf,[status(esa)],[cn2]) ).

cnf(l1,plain,
    ( ~ is_a_theorem(implies(sK42,implies(not(sK42),sK43)))
    | cn2 ),
    inference(instantiation,[status(thm)],[42]) ).

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

fof(hilbert_op_implies_and,plain,
    op_implies_and,
    file('Axioms/LCL006+2.ax',hilbert_op_implies_and) ).

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

cnf(l76,plain,
    op_implies_and,
    inference(instantiation,[status(thm)],[61]) ).

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

fof(hilbert_op_or,plain,
    op_or,
    file('Axioms/LCL006+2.ax',hilbert_op_or) ).

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

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

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

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

cnf(l31,plain,
    ( ~ or_1
    | is_a_theorem(implies(sK42,or(sK42,sK43))) ),
    inference(instantiation,[status(thm)],[21]) ).

fof(hilbert_or_1,plain,
    or_1,
    file('Axioms/LCL006+2.ax',hilbert_or_1) ).

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

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

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l40,l76,l30,l78,l31,l34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL452+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.08/0.35  % Computer : n013.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep  5 01:04:20 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.36  % launching worker at depth: 1
% 0.08/0.36  % launching worker at depth: 5
% 0.08/0.36  % launching worker at depth: 6
% 0.08/0.36  % launching worker at depth: 2
% 0.08/0.36  % launching worker at depth: 3
% 0.08/0.36  % launching worker at depth: 8
% 0.08/0.36  % launching worker at depth: 7
% 0.08/0.36  % launching worker at depth: 4
% 0.08/0.36  % launching worker at depth: 9
% 0.08/0.36  % launching worker at depth: 10
% 0.08/0.37  % launching worker at depth: 11
% 0.12/0.42  % launching worker at depth: 12
% 0.96/0.49  % SZS status Theorem for theBenchmark
% 0.96/0.49  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------