↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n020.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 03:33:42 PM UTC 2026

% Result   : Theorem 0.14s 6.04s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   6 unt;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  11   ~;  18   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ( b = d
    | a = c ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel48_2) ).

fof(f1_nnf,plain,
    ( b = d
    | a = c ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ( b = d
    | a = c ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( b = d
    | a = c ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

fof(f0,axiom,
    ( c = d
    | a = b ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel48_1) ).

fof(f0_nnf,plain,
    ( c = d
    | a = b ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ( c = d
    | a = b ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( c = d
    | a = b ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p6,plain,
    ( c = b
    | a = b
    | a = c ),
    inference(superposition,[status(thm)],[c1,c0]) ).

fof(f2,conjecture,
    ( b = c
    | a = d ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel48) ).

fof(f2_neg,negated_conjecture,
    ~ ( b = c
      | a = d ),
    inference(negated_conjecture,[status(cth)],[f2]) ).

fof(f2_nnf,plain,
    ( b != c
    & a != d ),
    inference(nnf_transformation,[status(thm)],[f2_neg]) ).

fof(f2_sk,plain,
    ( b != c
    & a != d ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c3,plain,
    b != c,
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p8,plain,
    ( b != b
    | a = b
    | a = c ),
    inference(superposition,[status(thm)],[p6,c3]) ).

cnf(p9,plain,
    ( a = b
    | a = c ),
    inference(equality_resolution,[status(thm)],[p8]) ).

cnf(c2,plain,
    a != d,
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p4,plain,
    ( a != c
    | a = b ),
    inference(superposition,[status(thm)],[c0,c2]) ).

cnf(p13,plain,
    ( a = b
    | a = b ),
    inference(resolution,[status(thm)],[p9,p4]) ).

cnf(p14,plain,
    a = b,
    inference(factoring,[status(thm)],[p13]) ).

cnf(p5,plain,
    ( a != b
    | a = c ),
    inference(superposition,[status(thm)],[c1,c2]) ).

cnf(p17,plain,
    a = c,
    inference(resolution,[status(thm)],[p14,p5]) ).

cnf(p15,plain,
    a != c,
    inference(superposition,[status(thm)],[p14,c3]) ).

cnf(p19,plain,
    $false,
    inference(resolution,[status(thm)],[p17,p15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN071+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.60  % Computer : n020.cluster.edu
% 0.10/5.60  % Model    : x86_64 x86_64
% 0.10/5.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.60  % Memory   : 8046.5625MB
% 0.10/5.60  % OS       : Linux 6.8.0-71-generic
% 0.10/5.60  % CPULimit : 300
% 0.10/5.60  % WCLimit  : 300
% 0.10/5.60  % DateTime : Fri Sep 25 00:05:10 UTC 2026
% 0.10/5.60  % CPUTime  : 
% 0.10/5.60  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/6.04  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/6.04  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------