↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n016.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:08 PM UTC 2026

% Result   : Unsatisfiable 5.41s 6.19s
% Output   : Proof 5.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (  15 unt;   0 def)
%            Number of atoms       :   23 (   6 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   14 (  10   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-4 aty)
%            Number of variables   :   26 (   0 sgn   8   !;   0   ?)

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

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

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

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

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

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

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

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

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

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

cnf(t9,plain,
    theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
    inference(hyper_resolution,[status(thm)],[hi5,hi3]) ).

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

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

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL172-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.38  % Computer : n016.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Wed Sep 23 22:14:33 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.41/6.19  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.41/6.19  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------