↑ Up

FindProof---0.1.UNS-CRf.s

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

% Result   : Unsatisfiable 55.02s 7.78s
% Output   : CNFRefutation 55.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;   3 RR)
%            Number of literals    :   36 (  35 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    :   11 (  11 usr;   4 con; 0-4 aty)
%            Number of variables   :   77 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(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(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(h16,plain,
    theorem(or(V0,or(not(V1),V1))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h3,h1,hi1]) ).

cnf(h52,plain,
    theorem(or(not(V0),V0)) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h16,h16,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(h87,plain,
    theorem(or(V0,not(V0))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h2,h52,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(h24,plain,
    theorem(or(not(or(V0,V1)),or(V0,or(V2,V1)))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h4,h1,hi1]) ).

cnf(h312,plain,
    theorem(or(V0,or(V1,not(V0)))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h24,h87,hi1]) ).

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

cnf(h8079,plain,
    theorem(or(V0,not(not(or(V1,not(V0)))))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h148,h312,hi1]) ).

cnf(h52059,plain,
    theorem(or(not(not(or(V0,not(V1)))),V1)) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h2,h8079,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(t255,plain,
    theorem(or(not(or(not(X1),X2)),or(not(not(or(X3,not(X1)))),X2))) = true,
    inference(hyper_resolution,[status(thm)],[hi7,h19,h52059,hi1]) ).

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(t4996,plain,
    theorem(implies(or(not(X1),X2),or(not(not(or(X3,not(X1)))),X2))) = true,
    inference(step,[status(thm)],[t255,t257]) ).

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

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

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

cnf(t808,plain,
    true = theorem(implies(implies(X1,X2),implies(not(implies(X3,not(X1))),X2))),
    inference(cp,[status(thm)],[t807,t257]) ).

cnf(t22,axiom,
    not(or(not(X1),not(X2))) = and(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t4869,plain,
    not(implies(X1,not(X2))) = and(X1,X2),
    inference(step,[status(thm)],[t22,t257]) ).

cnf(t258,plain,
    not(implies(X1,not(X2))) = and(X1,X2),
    inference(orient,[status(thm)],[t4869]) ).

cnf(t5214,plain,
    true = theorem(implies(implies(X1,X2),implies(and(X3,X1),X2))),
    inference(step,[status(thm)],[t808,t258]) ).

cnf(t4859,plain,
    theorem(implies(implies(X1,X2),implies(and(X3,X1),X2))) = true,
    inference(orient,[status(thm)],[t5214]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL250-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n019.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 : Wed Sep 23 22:36:04 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 55.02/7.78  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 55.02/7.78  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------