↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO028-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n010.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:16:49 AM UTC 2026

% Result   : Unsatisfiable 0.15s 10.74s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   41 (  24 unt;   0 def)
%            Number of atoms       :   87 (  16 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   97 (  51   ~;  46   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   3 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   :  117 (   8 sgn  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity_for_equidistance,axiom,
    ! [VAR_0,VAR_1] : equidistant(VAR_0,VAR_1,VAR_1,VAR_0),
    file('theBenchmark.p',reflexivity_for_equidistance) ).

cnf(c_1,plain,
    equidistant(A,B,B,A),
    inference(clausify,[status(thm)],[reflexivity_for_equidistance]) ).

fof(transitivity_for_equidistance,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
      ( equidistant(VAR_2,VAR_3,VAR_4,VAR_5)
      | ~ equidistant(VAR_0,VAR_1,VAR_4,VAR_5)
      | ~ equidistant(VAR_0,VAR_1,VAR_2,VAR_3) ),
    file('theBenchmark.p',transitivity_for_equidistance) ).

cnf(c_2,plain,
    ( equidistant(C,D,E,F)
    | ~ equidistant(A,B,E,F)
    | ~ equidistant(A,B,C,D) ),
    inference(clausify,[status(thm)],[transitivity_for_equidistance]) ).

fof(identity_for_equidistance,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( VAR_0 = VAR_1
      | ~ equidistant(VAR_0,VAR_1,VAR_2,VAR_2) ),
    file('theBenchmark.p',identity_for_equidistance) ).

cnf(c_3,plain,
    ( A = B
    | ~ equidistant(A,B,C,C) ),
    inference(clausify,[status(thm)],[identity_for_equidistance]) ).

fof(segment_construction1,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] : between(VAR_0,VAR_1,extension(VAR_0,VAR_1,VAR_2,VAR_3)),
    file('theBenchmark.p',segment_construction1) ).

cnf(c_4,plain,
    between(A,B,extension(A,B,C,D)),
    inference(clausify,[status(thm)],[segment_construction1]) ).

fof(segment_construction2,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] : equidistant(VAR_0,extension(VAR_1,VAR_0,VAR_2,VAR_3),VAR_2,VAR_3),
    file('theBenchmark.p',segment_construction2) ).

cnf(c_5,plain,
    equidistant(A,extension(B,A,C,D),C,D),
    inference(clausify,[status(thm)],[segment_construction2]) ).

fof(outer_five_segment,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6,VAR_7] :
      ( equidistant(VAR_4,VAR_6,VAR_5,VAR_7)
      | VAR_0 = VAR_1
      | ~ between(VAR_2,VAR_3,VAR_5)
      | ~ between(VAR_0,VAR_1,VAR_4)
      | ~ equidistant(VAR_1,VAR_6,VAR_3,VAR_7)
      | ~ equidistant(VAR_0,VAR_6,VAR_2,VAR_7)
      | ~ equidistant(VAR_1,VAR_4,VAR_3,VAR_5)
      | ~ equidistant(VAR_0,VAR_1,VAR_2,VAR_3) ),
    file('theBenchmark.p',outer_five_segment) ).

cnf(c_6,plain,
    ( equidistant(E,V6,F,V7)
    | A = B
    | ~ between(C,D,F)
    | ~ between(A,B,E)
    | ~ equidistant(B,V6,D,V7)
    | ~ equidistant(A,V6,C,V7)
    | ~ equidistant(B,E,D,F)
    | ~ equidistant(A,B,C,D) ),
    inference(clausify,[status(thm)],[outer_five_segment]) ).

fof(w_to_x_equals_y_to_z,axiom,
    equidistant(w,x,y,z),
    file('theBenchmark.p',w_to_x_equals_y_to_z) ).

cnf(c_19,plain,
    equidistant(w,x,y,z),
    inference(clausify,[status(thm)],[w_to_x_equals_y_to_z]) ).

fof(u_not_v,axiom,
    u != v,
    file('theBenchmark.p',u_not_v) ).

cnf(c_20,plain,
    u != v,
    inference(clausify,[status(thm)],[u_not_v]) ).

cnf(c_21,plain,
    v != u,
    inference(copy,[status(thm)],[c_20]) ).

fof(prove_equal_extensions,axiom,
    extension(u,v,w,x) != extension(u,v,y,z),
    file('theBenchmark.p',prove_equal_extensions) ).

cnf(c_22,plain,
    extension(u,v,w,x) != extension(u,v,y,z),
    inference(clausify,[status(thm)],[prove_equal_extensions]) ).

cnf(c_23,plain,
    extension(u,v,y,z) != extension(u,v,w,x),
    inference(copy,[status(thm)],[c_22]) ).

cnf(c_24,plain,
    ( equidistant(C,D,C,D)
    | ~ equidistant(A,B,C,D) ),
    inference(factor,[status(thm)],[c_2]) ).

cnf(c_41,plain,
    ( equidistant(B,A,C,D)
    | ~ equidistant(A,B,C,D) ),
    inference(resolve,[status(thm)],[c_2,c_1]) ).

cnf(c_42,plain,
    ( equidistant(C,D,B,A)
    | ~ equidistant(A,B,C,D) ),
    inference(resolve,[status(thm)],[c_2,c_1]) ).

cnf(c_105,plain,
    ( equidistant(y,z,A,B)
    | ~ equidistant(w,x,A,B) ),
    inference(resolve,[status(thm)],[c_19,c_2]) ).

cnf(c_114,plain,
    ~ equidistant(extension(u,v,y,z),extension(u,v,w,x),A,A),
    inference(resolve,[status(thm)],[c_3,c_23]) ).

cnf(c_118,plain,
    equidistant(A,B,A,B),
    inference(resolve,[status(thm)],[c_24,c_5]) ).

cnf(c_175,plain,
    equidistant(A,B,extension(C,D,A,B),D),
    inference(resolve,[status(thm)],[c_42,c_5]) ).

cnf(c_413,plain,
    ( equidistant(B,E,C,F)
    | D = A
    | ~ between(D,A,C)
    | ~ between(D,A,B)
    | ~ equidistant(A,E,A,F)
    | ~ equidistant(D,E,D,F)
    | ~ equidistant(A,B,A,C) ),
    inference(resolve,[status(thm)],[c_6,c_118]) ).

cnf(c_414,plain,
    ( equidistant(B,D,C,D)
    | E = A
    | ~ between(E,A,C)
    | ~ between(E,A,B)
    | ~ equidistant(A,D,A,D)
    | ~ equidistant(A,B,A,C) ),
    inference(resolve,[status(thm)],[c_413,c_118]) ).

cnf(c_415,plain,
    ( equidistant(B,E,C,E)
    | D = A
    | ~ between(D,A,C)
    | ~ between(D,A,B)
    | ~ equidistant(A,B,A,C) ),
    inference(resolve,[status(thm)],[c_414,c_118]) ).

cnf(c_416,plain,
    ( equidistant(extension(B,A,C,D),F,E,F)
    | B = A
    | ~ between(B,A,E)
    | ~ equidistant(A,extension(B,A,C,D),A,E) ),
    inference(resolve,[status(thm)],[c_415,c_4]) ).

cnf(c_417,plain,
    ( equidistant(extension(B,A,C,D),V6,extension(B,A,E,F),V6)
    | B = A
    | ~ equidistant(A,extension(B,A,C,D),A,extension(B,A,E,F)) ),
    inference(resolve,[status(thm)],[c_416,c_4]) ).

cnf(c_418,plain,
    u != v,
    inference(copy,[status(thm)],[c_21]) ).

cnf(c_419,plain,
    ( equidistant(extension(u,v,A,B),E,extension(u,v,C,D),E)
    | ~ equidistant(v,extension(u,v,A,B),v,extension(u,v,C,D)) ),
    inference(resolve,[status(thm)],[c_417,c_418]) ).

cnf(c_287,plain,
    ~ equidistant(v,extension(u,v,y,z),v,extension(u,v,w,x)),
    inference(resolve,[status(thm)],[c_419,c_114]) ).

cnf(c_294,plain,
    ~ equidistant(extension(u,v,y,z),v,v,extension(u,v,w,x)),
    inference(resolve,[status(thm)],[c_41,c_287]) ).

cnf(c_322,plain,
    ~ equidistant(extension(u,v,w,x),v,extension(u,v,y,z),v),
    inference(resolve,[status(thm)],[c_42,c_294]) ).

cnf(c_396,plain,
    equidistant(y,z,extension(A,B,w,x),B),
    inference(resolve,[status(thm)],[c_175,c_105]) ).

cnf(c_420,plain,
    ( equidistant(C,D,extension(E,F,A,B),F)
    | ~ equidistant(A,B,C,D) ),
    inference(resolve,[status(thm)],[c_2,c_175]) ).

cnf(c_421,plain,
    ~ equidistant(y,z,extension(u,v,w,x),v),
    inference(resolve,[status(thm)],[c_420,c_322]) ).

cnf(c_412,plain,
    $false,
    inference(resolve,[status(thm)],[c_396,c_421]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO028-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.58  % Computer : n010.cluster.edu
% 0.11/10.58  % Model    : x86_64 x86_64
% 0.11/10.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.58  % Memory   : 8046.5625MB
% 0.11/10.58  % OS       : Linux 6.8.0-71-generic
% 0.11/10.58  % CPULimit : 300
% 0.11/10.58  % WCLimit  : 300
% 0.11/10.58  % DateTime : Fri Sep 25 12:33:59 UTC 2026
% 0.11/10.58  % CPUTime  : 
% 0.11/10.58  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/10.58  % Process 749945 was started by sandbox2 on n010,
% 0.11/10.58  % Fri Sep 25 12:33:59 2026
% 0.11/10.58  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/10.59  
% 0.11/10.59  % From the command line: assign(max_seconds, 300).
% 0.15/10.74  
% 0.15/10.74  % SZS status Unsatisfiable for theBenchmark
% 0.15/10.74  
% 0.15/10.74  % Proof 1 at 0.13 (+ 0.01) seconds.
% 0.15/10.74  % Length of proof is 23.
% 0.15/10.74  % Level of proof is 6.
% 0.15/10.74  % Maximum clause weight is 41.000.
% 0.15/10.74  % Given clauses 100.
% 0.15/10.74  
% 0.15/10.74  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------