↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : LCL218-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n015.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 : Fri Sep 25 02:01:24 PM UTC 2026

% Result   : Unsatisfiable 6.30s 1.35s
% Output   : CNFRefutation 6.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   21 (  21 unt;   0 nHn;  13 RR)
%            Number of literals    :   21 (  20 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-4 aty)
%            Number of variables   :   17 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(hi1,axiom,
    axiom(or(not(A),or(B,A))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h3,plain,
    axiom(or(not(p),or(q,p))) = true,
    inference(hyper_resolution,[status(thm)],[hi1]) ).

cnf(h0,plain,
    axiom(or(not(q),or(q,q))) = true,
    inference(hyper_resolution,[status(thm)],[hi1]) ).

cnf(hi5,axiom,
    ifeq(axiom(X),true,theorem(X),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(hi0,axiom,
    axiom(or(not(or(A,A)),A)) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h1,plain,
    theorem(or(not(or(q,q)),q)) = true,
    inference(hyper_resolution,[status(thm)],[hi5,hi0]) ).

cnf(hi7,axiom,
    ifeq(theorem(or(not(Y),Z)),true,ifeq(axiom(or(not(X),Y)),true,theorem(or(not(X),Z)),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h2,plain,
    theorem(or(not(q),q)) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h1,h0]) ).

cnf(hi6,axiom,
    ifeq(theorem(Y),true,ifeq(axiom(or(not(Y),X)),true,theorem(X),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(hi4,axiom,
    axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h4,plain,
    theorem(or(not(or(not(or(p,q)),q)),or(not(or(p,q)),q))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,h2,hi4]) ).

cnf(hi3,axiom,
    axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h5,plain,
    theorem(or(not(or(p,q)),or(not(or(not(or(p,q)),q)),q))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,h4,hi3]) ).

cnf(hi2,axiom,
    axiom(or(not(or(A,B)),or(B,A))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h6,plain,
    theorem(or(not(or(q,p)),or(not(or(not(or(p,q)),q)),q))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h5,hi2]) ).

cnf(h7,plain,
    theorem(or(not(p),or(not(or(not(or(p,q)),q)),q))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h6,h3]) ).

cnf(t6,plain,
    theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,h7,hi3]) ).

cnf(t16,plain,
    theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) = true,
    inference(orient,[status(thm)],[t6]) ).

cnf(goal_0,negated_conjecture,
    theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t16]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL218-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.39  % Computer : n015.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Wed Sep 23 22:27:41 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.30/1.35  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.30/1.35  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------