↑ Up

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

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

% Computer : n007.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:48 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (  11 unt;   0 def)
%            Number of atoms       :   23 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (  11   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 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   :   45 (   5 sgn  15   !;   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_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(prove_congruence,axiom,
    ~ equidistant(u,u,v,v),
    file('theBenchmark.p',prove_congruence) ).

cnf(c_19,plain,
    ~ equidistant(u,u,v,v),
    inference(clausify,[status(thm)],[prove_congruence]) ).

cnf(c_88,plain,
    A = extension(B,A,C,C),
    inference(resolve,[status(thm)],[c_5,c_3]) ).

cnf(c_39,plain,
    extension(A,B,C,C) = B,
    inference(copy,[status(thm)],[c_88]) ).

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

cnf(c_90,plain,
    ~ equidistant(A,extension(B,A,v,v),u,u),
    inference(resolve,[status(thm)],[c_89,c_19]) ).

cnf(c_86,plain,
    ~ equidistant(A,A,u,u),
    inference(paramod,[status(thm)],[c_39,c_90]) ).

cnf(c_87,plain,
    $false,
    inference(resolve,[status(thm)],[c_86,c_1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO024-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n007.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:31:08 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 996401 was started by sandbox on n007,
% 0.09/0.36  % Fri Sep 25 12:31:08 2026
% 0.09/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.37  
% 0.13/0.37  % From the command line: assign(max_seconds, 300).
% 0.13/0.38  
% 0.13/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.38  
% 0.13/0.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.38  % Length of proof is 8.
% 0.13/0.38  % Level of proof is 3.
% 0.13/0.38  % Maximum clause weight is 15.000.
% 0.13/0.38  % Given clauses 19.
% 0.13/0.38  
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------