↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : LCL203-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 : n012.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:20 PM UTC 2026

% Result   : Unsatisfiable 16.36s 2.45s
% Output   : CNFRefutation 16.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   25 (  25 unt;   0 nHn;   4 RR)
%            Number of literals    :   25 (  24 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-4 aty)
%            Number of variables   :   52 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t5,axiom,
    or(not(X1),X2) = implies(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t257,plain,
    or(not(X1),X2) = implies(X1,X2),
    inference(orient,[status(thm)],[t5]) ).

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

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

cnf(hi1,axiom,
    implies(X,Y) = or(not(X),Y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(h1,plain,
    theorem(or(not(V0),or(V1,V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,hi2,hi1]) ).

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

cnf(h2,plain,
    theorem(or(not(or(V0,V1)),or(V1,V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,hi3,hi1]) ).

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

cnf(h4,plain,
    theorem(or(not(or(not(V0),V1)),or(not(or(V2,V0)),or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,hi5,hi1]) ).

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

cnf(h23,plain,
    theorem(or(not(or(V0,or(V1,V2))),or(V0,or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h4,h2,hi1]) ).

cnf(h291,plain,
    theorem(or(not(V0),or(V0,V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h23,h1,hi1]) ).

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

cnf(h3,plain,
    theorem(or(not(or(V0,or(V1,V2))),or(V1,or(V0,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi6,hi4,hi1]) ).

cnf(h19,plain,
    theorem(or(not(or(V0,V1)),or(not(or(not(V1),V2)),or(V0,V2)))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h3,h4,hi1]) ).

cnf(h517,plain,
    theorem(or(not(or(not(or(V0,V1)),V2)),or(not(V0),V2))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h19,h291,hi1]) ).

cnf(t179,plain,
    theorem(or(not(not(or(X1,X2))),or(not(X1),X3))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h517,h517,hi1]) ).

cnf(t878,plain,
    theorem(implies(not(or(X1,X2)),or(not(X1),X3))) = true,
    inference(step,[status(thm)],[t179,t257]) ).

cnf(t879,plain,
    theorem(implies(not(or(X1,X2)),implies(X1,X3))) = true,
    inference(step,[status(thm)],[t878,t257]) ).

cnf(t730,plain,
    theorem(implies(not(or(X1,X2)),implies(X1,X3))) = true,
    inference(orient,[status(thm)],[t879]) ).

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

cnf(g0_0,plain,
    theorem(implies(not(or(p,q)),implies(p,not(q)))) != true,
    inference(rw,[status(thm)],[goal_0,t257]) ).

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

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

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