↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GEO025-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 : 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 : Sun Sep 27 07:13:55 AM UTC 2026

% Result   : Unsatisfiable 18.06s 4.47s
% Output   : CNFRefutation 18.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   39 (  24 unt;  10 nHn;  33 RR)
%            Number of literals    :   83 (  15 equ;  36 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-4 aty)
%            Number of variables   :   65 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(u_to_v_equals_u1_to_v1,hypothesis,
    equidistant(u,v,u1,v1) ).

cnf(v_to_w_equals_v1_to_w1,hypothesis,
    equidistant(v,w,v1,w1) ).

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w) ).

cnf(v1_between_u1_and_w1,hypothesis,
    between(u1,v1,w1) ).

cnf(prove_equal_sums,negated_conjecture,
    ~ equidistant(u,w,u1,w1) ).

cnf(reflexivity_for_equidistance,axiom,
    equidistant(X0,X1,X1,X0) ).

cnf(transitivity_for_equidistance,axiom,
    ( equidistant(X2,X3,X4,X5)
    | ~ equidistant(X0,X1,X4,X5)
    | ~ equidistant(X0,X1,X2,X3) ) ).

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(outer_five_segment,axiom,
    ( equidistant(X4,X6,X5,X7)
    | X0 = X1
    | ~ between(X2,X3,X5)
    | ~ between(X0,X1,X4)
    | ~ equidistant(X1,X6,X3,X7)
    | ~ equidistant(X0,X6,X2,X7)
    | ~ equidistant(X1,X4,X3,X5)
    | ~ equidistant(X0,X1,X2,X3) ) ).

cnf(c0,plain,
    equidistant(u,v,u1,v1),
    inference(clausification,[status(esa)],[u_to_v_equals_u1_to_v1]) ).

cnf(c1,plain,
    equidistant(v,w,v1,w1),
    inference(clausification,[status(esa)],[v_to_w_equals_v1_to_w1]) ).

cnf(c2,plain,
    between(u,v,w),
    inference(clausification,[status(esa)],[v_between_u_and_w]) ).

cnf(c3,plain,
    between(u1,v1,w1),
    inference(clausification,[status(esa)],[v1_between_u1_and_w1]) ).

cnf(c4,plain,
    ~ equidistant(u,w,u1,w1),
    inference(clausification,[status(esa)],[prove_equal_sums]) ).

cnf(c5,plain,
    equidistant(X0,X1,X1,X0),
    inference(clausification,[status(esa)],[reflexivity_for_equidistance]) ).

cnf(c6,plain,
    ( equidistant(X2,X3,X4,X5)
    | ~ equidistant(X0,X1,X4,X5)
    | ~ equidistant(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[transitivity_for_equidistance]) ).

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

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

cnf(c10,plain,
    ( ~ equidistant(X1,X6,X3,X7)
    | X0 = X1
    | ~ between(X2,X3,X5)
    | equidistant(X4,X6,X5,X7)
    | ~ equidistant(X0,X6,X2,X7)
    | ~ between(X0,X1,X4)
    | ~ equidistant(X1,X4,X3,X5)
    | ~ equidistant(X0,X1,X2,X3) ),
    inference(clausification,[status(esa)],[outer_five_segment]) ).

cnf(d0,plain,
    ( ~ equidistant(X3,X2,X0,X1)
    | equidistant(X0,X1,X2,X3) ),
    inference(resolution,[status(thm)],[c6,c5]) ).

cnf(d1,plain,
    equidistant(u1,v1,v,u),
    inference(resolution,[status(thm)],[d0,c0]) ).

cnf(d2,plain,
    equidistant(v,u,v1,u1),
    inference(resolution,[status(thm)],[d1,d0]) ).

cnf(d3,plain,
    ( ~ between(u,v,X0)
    | ~ between(u1,v1,X2)
    | ~ equidistant(u,X1,u1,X3)
    | ~ equidistant(v,X0,v1,X2)
    | ~ equidistant(v,X1,v1,X3)
    | equidistant(X0,X1,X2,X3)
    | u = v ),
    inference(resolution,[status(thm)],[c10,c0]) ).

cnf(d4,plain,
    ( ~ between(u1,v1,w1)
    | ~ between(u,v,w)
    | ~ equidistant(v,X0,v1,X1)
    | ~ equidistant(u,X0,u1,X1)
    | equidistant(w,X0,w1,X1)
    | u = v ),
    inference(resolution,[status(thm)],[d3,c1]) ).

cnf(d5,plain,
    ( ~ between(u1,v1,w1)
    | equidistant(w,X0,w1,X1)
    | ~ equidistant(v,X0,v1,X1)
    | ~ equidistant(u,X0,u1,X1)
    | u = v ),
    inference(resolution,[status(thm)],[c2,d4]) ).

cnf(d6,plain,
    ( equidistant(w,X0,w1,X1)
    | ~ equidistant(v,X0,v1,X1)
    | ~ equidistant(u,X0,u1,X1)
    | u = v ),
    inference(resolution,[status(thm)],[c3,d5]) ).

cnf(d7,plain,
    ( equidistant(w,u,w1,u1)
    | ~ equidistant(u,u,u1,u1)
    | u = v ),
    inference(resolution,[status(thm)],[d6,d2]) ).

cnf(d8,plain,
    X0 = extension(X1,X0,X2,X2),
    inference(resolution,[status(thm)],[c9,c7]) ).

cnf(d9,plain,
    equidistant(X1,X1,X2,X2),
    inference(superposition,[status(thm)],[d8,c9]) ).

cnf(d10,plain,
    ( equidistant(w,u,w1,u1)
    | u = v ),
    inference(resolution,[status(thm)],[d9,d7]) ).

cnf(d11,plain,
    ( equidistant(w1,u1,u,w)
    | u = v ),
    inference(resolution,[status(thm)],[d10,d0]) ).

cnf(d12,plain,
    ( equidistant(u,w,u1,w1)
    | u = v ),
    inference(resolution,[status(thm)],[d11,d0]) ).

cnf(d13,plain,
    u = v,
    inference(resolution,[status(thm)],[c4,d12]) ).

cnf(d14,plain,
    equidistant(u1,v1,u,u),
    inference(demodulation,[status(thm)],[d1,d13]) ).

cnf(d15,plain,
    u1 = v1,
    inference(resolution,[status(thm)],[d14,c7]) ).

cnf(d16,plain,
    equidistant(u,w,v1,w1),
    inference(demodulation,[status(thm)],[c1,d13]) ).

cnf(d17,plain,
    equidistant(u,w,u1,w1),
    inference(demodulation,[status(thm)],[d16,d15]) ).

cnf(d18,plain,
    $false,
    inference(resolution,[status(thm)],[c4,d17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GEO025-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n020.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Fri Sep 25 12:33:48 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.06/4.47  % SZS status Unsatisfiable for theBenchmark.p
% 18.06/4.47  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------