↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO030-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 : n009.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:50 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.43s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   35 (  20 unt;   0 def)
%            Number of atoms       :   79 (  18 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   88 (  44   ~;  44   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   64 (   0 sgn  19   !;   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(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(v_between_u_and_w,axiom,
    between(u,v,w),
    file('theBenchmark.p',v_between_u_and_w) ).

cnf(c_19,plain,
    between(u,v,w),
    inference(clausify,[status(thm)],[v_between_u_and_w]) ).

fof(u_to_w_equals_u_to_w1,axiom,
    equidistant(u,w,u,w1),
    file('theBenchmark.p',u_to_w_equals_u_to_w1) ).

cnf(c_20,plain,
    equidistant(u,w,u,w1),
    inference(clausify,[status(thm)],[u_to_w_equals_u_to_w1]) ).

fof(v_to_w_equals_v_to_w1,axiom,
    equidistant(v,w,v,w1),
    file('theBenchmark.p',v_to_w_equals_v_to_w1) ).

cnf(c_21,plain,
    equidistant(v,w,v,w1),
    inference(clausify,[status(thm)],[v_to_w_equals_v_to_w1]) ).

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

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

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

fof(prove_w_is_w1,axiom,
    w != w1,
    file('theBenchmark.p',prove_w_is_w1) ).

cnf(c_24,plain,
    w != w1,
    inference(clausify,[status(thm)],[prove_w_is_w1]) ).

cnf(c_25,plain,
    w1 != w,
    inference(copy,[status(thm)],[c_24]) ).

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

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

cnf(c_45,plain,
    equidistant(A,B,A,B),
    inference(resolve,[status(thm)],[c_300,c_1]) ).

cnf(c_301,plain,
    w != w1,
    inference(copy,[status(thm)],[c_25]) ).

cnf(c_176,plain,
    ~ equidistant(w,w1,A,A),
    inference(resolve,[status(thm)],[c_3,c_301]) ).

cnf(c_302,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_45]) ).

cnf(c_303,plain,
    ( equidistant(E,B,E,C)
    | A = D
    | ~ between(A,D,E)
    | ~ between(A,D,E)
    | ~ equidistant(D,B,D,C)
    | ~ equidistant(A,B,A,C) ),
    inference(resolve,[status(thm)],[c_302,c_45]) ).

cnf(c_304,plain,
    ( equidistant(B,w,B,w1)
    | u = A
    | ~ between(u,A,B)
    | ~ between(u,A,B)
    | ~ equidistant(A,w,A,w1) ),
    inference(resolve,[status(thm)],[c_303,c_20]) ).

cnf(c_305,plain,
    ( equidistant(A,w,A,w1)
    | u = v
    | ~ between(u,v,A)
    | ~ between(u,v,A) ),
    inference(resolve,[status(thm)],[c_304,c_21]) ).

cnf(c_306,plain,
    ( equidistant(w,w,w,w1)
    | u = v
    | ~ between(u,v,w) ),
    inference(resolve,[status(thm)],[c_305,c_19]) ).

cnf(c_307,plain,
    ( equidistant(w,w,w,w1)
    | u = v ),
    inference(resolve,[status(thm)],[c_306,c_19]) ).

cnf(c_308,plain,
    ( equidistant(w,w,w,w1)
    | v = u ),
    inference(copy,[status(thm)],[c_307]) ).

cnf(c_249,plain,
    equidistant(w,w,w,w1),
    inference(resolve,[status(thm)],[c_23,c_308]) ).

cnf(c_298,plain,
    ~ equidistant(A,A,w,w1),
    inference(resolve,[status(thm)],[c_44,c_176]) ).

cnf(c_299,plain,
    $false,
    inference(resolve,[status(thm)],[c_298,c_249]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO030-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.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 12:33:44 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36  % Process 1610349 was started by sandbox2 on n009,
% 0.09/0.36  % Fri Sep 25 12:33:44 2026
% 0.09/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 0.09/0.43  
% 0.09/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.43  
% 0.09/0.43  % Proof 1 at 0.06 (+ 0.01) seconds.
% 0.09/0.43  % Length of proof is 17.
% 0.09/0.43  % Level of proof is 4.
% 0.09/0.43  % Maximum clause weight is 41.000.
% 0.09/0.43  % Given clauses 53.
% 0.09/0.43  
% 0.09/0.43  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------