↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n006.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 01:16:58 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.88s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  17 unt;   0 def)
%            Number of atoms       :   33 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-6 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-4 aty)
%            Number of variables   :   40 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f4,hypothesis,
    trapezoid(a,b,c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_trapezoid) ).

fof(f4_nnf,plain,
    trapezoid(a,b,c,d),
    inference(nnf_transformation,[status(thm)],[f4]) ).

cnf(c4,plain,
    trapezoid(a,b,c,d),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(hi4,axiom,
    trapezoid(a,b,c,d) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(h0,plain,
    trapezoid(a,b,c,d) = true,
    inference(hyper_resolution,[status(thm)],[hi4]) ).

cnf(f2,axiom,
    ( parallel(V,W,U,X)
    | ~ trapezoid(U,V,W,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',trapezoid_definition) ).

fof(f2_nnf,plain,
    ! [U,V,W,X] :
      ( parallel(V,W,U,X)
      | ~ trapezoid(U,V,W,X) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [U,V,W,X] :
      ( parallel(V,W,U,X)
      | ~ trapezoid(U,V,W,X) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( parallel(X1,X2,X0,X3)
    | ~ trapezoid(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    ifeq(trapezoid(X0,X1,X2,X3),true,parallel(X1,X2,X0,X3),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h1,plain,
    parallel(b,c,a,d) = true,
    inference(hyper_resolution,[status(thm)],[hi2,h0]) ).

cnf(f3,axiom,
    ( eq(X,V,U,V,X,Y)
    | ~ parallel(U,V,X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interior_angles_are_equal) ).

fof(f3_nnf,plain,
    ! [U,V,X,Y] :
      ( eq(X,V,U,V,X,Y)
      | ~ parallel(U,V,X,Y) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [U,V,X,Y] :
      ( eq(X,V,U,V,X,Y)
      | ~ parallel(U,V,X,Y) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( eq(X2,X1,X0,X1,X2,X3)
    | ~ parallel(X0,X1,X2,X3) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,axiom,
    ifeq(parallel(X0,X1,X2,X3),true,eq(X2,X1,X0,X1,X2,X3),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t2,plain,
    eq(a,c,b,c,a,d) = true,
    inference(hyper_resolution,[status(thm)],[hi3,h1]) ).

cnf(t12,plain,
    eq(a,c,b,c,a,d) = true,
    inference(orient,[status(thm)],[t2]) ).

cnf(f5,negated_conjecture,
    ~ eq(a,c,b,c,a,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_angles_equal) ).

fof(f5_nnf,plain,
    ~ eq(a,c,b,c,a,d),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ~ eq(a,c,b,c,a,d),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ~ eq(a,c,b,c,a,d),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(goal_0,negated_conjecture,
    eq(a,c,b,c,a,d) != true,
    inference(equality_encoding,[status(esa)],[c5]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO079-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.12/5.38  % Computer : n006.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.38  % CPULimit : 300
% 0.12/5.38  % WCLimit  : 300
% 0.12/5.38  % DateTime : Wed Sep 23 10:45:05 UTC 2026
% 0.12/5.38  % CPUTime  : 
% 0.12/5.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/5.88  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.88  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------