↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GEO024-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n026.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 : Sun Sep 27 07:13:55 AM UTC 2026

% Result   : Unsatisfiable 11.76s 1.81s
% Output   : CNFRefutation 11.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   7 unt;   0 nHn;   5 RR)
%            Number of literals    :   11 (   3 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-4 aty)
%            Number of variables   :   19 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_congruence,negated_conjecture,
    ~ equidistant(u,u,v,v) ).

cnf(identity_for_equidistance,axiom,
    ( X0 = X1
    | ~ equidistant(X0,X1,X2,X2) ) ).

cnf(segment_construction2,axiom,
    equidistant(X0,extension(X1,X0,X2,X3),X2,X3) ).

cnf(c0,plain,
    ~ equidistant(u,u,v,v),
    inference(clausification,[status(esa)],[prove_congruence]) ).

cnf(c3,plain,
    ( X0 = X1
    | ~ equidistant(X0,X1,X2,X2) ),
    inference(clausification,[status(esa)],[identity_for_equidistance]) ).

cnf(c5,plain,
    equidistant(X0,extension(X1,X0,X2,X3),X2,X3),
    inference(clausification,[status(esa)],[segment_construction2]) ).

cnf(d0,plain,
    X0 = extension(X1,X0,X2,X2),
    inference(resolution,[status(thm)],[c5,c3]) ).

cnf(d1,plain,
    equidistant(X1,X1,X2,X2),
    inference(superposition,[status(thm)],[d0,c5]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[d1,c0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO024-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n026.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 12:35:54 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.76/1.81  % SZS status Unsatisfiable for theBenchmark.p
% 11.76/1.81  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------