↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO011-4 : 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 : n004.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:45 AM UTC 2026

% Result   : Unsatisfiable 0.17s 0.45s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  10 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   17 (   8   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    6 (   0 sgn   3   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(colinearity4,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( between(VAR_2,VAR_0,VAR_1)
      | between(VAR_1,VAR_2,VAR_0)
      | between(VAR_0,VAR_1,VAR_2)
      | ~ colinear(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',colinearity4) ).

cnf(c_1,plain,
    ( between(C,A,B)
    | between(B,C,A)
    | between(A,B,C)
    | ~ colinear(A,B,C) ),
    inference(clausify,[status(thm)],[colinearity4]) ).

fof(prove_lower_dimension_points_not_colinear,axiom,
    colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    file('theBenchmark.p',prove_lower_dimension_points_not_colinear) ).

cnf(c_5,plain,
    colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    inference(clausify,[status(thm)],[prove_lower_dimension_points_not_colinear]) ).

cnf(c_6,plain,
    ( between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2)
    | between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1)
    | between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) ),
    inference(resolve,[status(thm)],[c_5,c_1]) ).

fof(lower_dimension3,axiom,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    file('theBenchmark.p',lower_dimension3) ).

cnf(c_13,plain,
    ~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    inference(clausify,[status(thm)],[lower_dimension3]) ).

fof(lower_dimension2,axiom,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    file('theBenchmark.p',lower_dimension2) ).

cnf(c_14,plain,
    ~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
    inference(clausify,[status(thm)],[lower_dimension2]) ).

fof(lower_dimension1,axiom,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    file('theBenchmark.p',lower_dimension1) ).

cnf(c_15,plain,
    ~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
    inference(clausify,[status(thm)],[lower_dimension1]) ).

cnf(c_35,plain,
    ( between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2)
    | between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1) ),
    inference(resolve,[status(thm)],[c_15,c_6]) ).

cnf(c_36,plain,
    between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
    inference(resolve,[status(thm)],[c_14,c_35]) ).

cnf(c_34,plain,
    $false,
    inference(resolve,[status(thm)],[c_13,c_36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO011-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43  % Computer : n004.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:31:36 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43  % Process 3172703 was started by sandbox2 on n004,
% 0.17/0.43  % Fri Sep 25 12:31:36 2026
% 0.17/0.43  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.44  
% 0.17/0.44  % From the command line: assign(max_seconds, 300).
% 0.17/0.45  
% 0.17/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.45  
% 0.17/0.45  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.45  % Length of proof is 7.
% 0.17/0.45  % Level of proof is 2.
% 0.17/0.45  % Maximum clause weight is 12.000.
% 0.17/0.45  % Given clauses 0.
% 0.17/0.45  
% 0.17/0.45  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------