↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n011.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:17 PM UTC 2026

% Result   : Unsatisfiable 7.50s 1.49s
% Output   : Proof 7.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   51 (  43 unt;   0 def)
%            Number of atoms       :   63 (  26 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :  107 (   0 sgn  26   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f6,axiom,
    ( ~ axiom(X)
    | theorem(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f6_nnf,plain,
    ! [X] :
      ( ~ axiom(X)
      | theorem(X) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X] :
      ( ~ axiom(X)
      | theorem(X) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ axiom(X0)
    | theorem(X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(hi6,axiom,
    ifeq(axiom(X0),true,theorem(X0),true) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(f4,axiom,
    axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

fof(f4_nnf,plain,
    ! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(hi5,axiom,
    axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

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

fof(f5_nnf,plain,
    ! [X,Y] : implies(X,Y) = or(not(X),Y),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X,Y] : implies(X,Y) = or(not(X),Y),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    implies(X0,X1) = or(not(X0),X1),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(hi1,axiom,
    implies(X0,X1) = or(not(X0),X1),
    inference(equality_encoding,[status(esa)],[c5]) ).

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(f7,axiom,
    ( ~ theorem(Y)
    | ~ theorem(implies(Y,X))
    | theorem(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f7_nnf,plain,
    ! [X,Y] :
      ( ~ theorem(Y)
      | ~ theorem(implies(Y,X))
      | theorem(X) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y] :
      ( ~ theorem(Y)
      | ~ theorem(implies(Y,X))
      | theorem(X) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ( ~ theorem(X1)
    | ~ theorem(implies(X1,X0))
    | theorem(X0) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(hi7,axiom,
    ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c7]) ).

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

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

cnf(f2,axiom,
    axiom(implies(or(A,B),or(B,A))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f2_nnf,plain,
    ! [A,B] : axiom(implies(or(A,B),or(B,A))),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [A,B] : axiom(implies(or(A,B),or(B,A))),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    axiom(implies(or(X0,X1),or(X1,X0))),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi3,axiom,
    axiom(implies(or(X0,X1),or(X1,X0))) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

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

cnf(f3,axiom,
    axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f3_nnf,plain,
    ! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi4,axiom,
    axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

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

cnf(t5,plain,
    or(not(X1),X2) = implies(X1,X2),
    inference(equality_encoding,[status(esa)],[c5]) ).

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

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

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

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

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

cnf(f8,negated_conjecture,
    ~ theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f8_nnf,plain,
    ~ theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ~ theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ~ theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(goal_0,negated_conjecture,
    theorem(implies(implies(q,r),implies(or(q,p),or(p,r)))) != true,
    inference(equality_encoding,[status(esa)],[c8]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL194-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.20/0.44  % Computer : n011.cluster.edu
% 0.20/0.44  % Model    : x86_64 x86_64
% 0.20/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.44  % Memory   : 8046.5625MB
% 0.20/0.44  % OS       : Linux 6.8.0-71-generic
% 0.20/0.44  % CPULimit : 300
% 0.20/0.44  % WCLimit  : 300
% 0.20/0.44  % DateTime : Wed Sep 23 22:16:57 UTC 2026
% 0.20/0.45  % CPUTime  : 
% 0.20/0.45  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.50/1.49  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.50/1.49  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------