↑ Up

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

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

% Computer : n016.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 08:36:07 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_restriction_property4_1,axiom,
    ~ subclass(restrict(x,y,z),cross_product(y,z)),
    file('theBenchmark.p',prove_restriction_property4_1) ).

cnf(c_36,plain,
    ~ subclass(restrict(x,y,z),cross_product(y,z)),
    inference(clausify,[status(thm)],[prove_restriction_property4_1]) ).

fof(restriction2,axiom,
    ! [VAR_0,VAR_1,VAR_2] : intersection(cross_product(VAR_0,VAR_1),VAR_2) = restrict(VAR_2,VAR_0,VAR_1),
    file('theBenchmark.p',restriction2) ).

cnf(c_110,plain,
    intersection(cross_product(A,B),C) = restrict(C,A,B),
    inference(clausify,[status(thm)],[restriction2]) ).

cnf(c_111,plain,
    restrict(A,B,C) = intersection(cross_product(B,C),A),
    inference(copy,[status(thm)],[c_110]) ).

fof(intersection1,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( member(VAR_0,VAR_1)
      | ~ member(VAR_0,intersection(VAR_1,VAR_2)) ),
    file('theBenchmark.p',intersection1) ).

cnf(c_122,plain,
    ( member(A,B)
    | ~ member(A,intersection(B,C)) ),
    inference(clausify,[status(thm)],[intersection1]) ).

fof(not_subclass_members2,axiom,
    ! [VAR_0,VAR_1] :
      ( subclass(VAR_0,VAR_1)
      | ~ member(not_subclass_element(VAR_0,VAR_1),VAR_1) ),
    file('theBenchmark.p',not_subclass_members2) ).

cnf(c_142,plain,
    ( subclass(A,B)
    | ~ member(not_subclass_element(A,B),B) ),
    inference(clausify,[status(thm)],[not_subclass_members2]) ).

fof(not_subclass_members1,axiom,
    ! [VAR_0,VAR_1] :
      ( subclass(VAR_0,VAR_1)
      | member(not_subclass_element(VAR_0,VAR_1),VAR_0) ),
    file('theBenchmark.p',not_subclass_members1) ).

cnf(c_143,plain,
    ( subclass(A,B)
    | member(not_subclass_element(A,B),A) ),
    inference(clausify,[status(thm)],[not_subclass_members1]) ).

cnf(c_208,plain,
    ~ subclass(intersection(cross_product(y,z),x),cross_product(y,z)),
    inference(paramod,[status(thm)],[c_111,c_36]) ).

cnf(c_337,plain,
    ( member(not_subclass_element(intersection(A,B),C),A)
    | subclass(intersection(A,B),C) ),
    inference(resolve,[status(thm)],[c_143,c_122]) ).

cnf(c_7368,plain,
    ( subclass(intersection(A,B),A)
    | subclass(intersection(A,B),A) ),
    inference(resolve,[status(thm)],[c_337,c_142]) ).

cnf(c_7366,plain,
    subclass(intersection(A,B),A),
    inference(copy,[status(thm)],[c_7368]) ).

cnf(c_7367,plain,
    $false,
    inference(resolve,[status(thm)],[c_7366,c_208]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET253-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39  % Computer : n016.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sat Sep 26 07:28:44 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.39  % Process 296307 was started by sandbox2 on n016,
% 0.13/0.39  % Sat Sep 26 07:28:44 2026
% 0.13/0.39  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.41  
% 0.18/0.41  % From the command line: assign(max_seconds, 300).
% 7.71/1.47  
% 7.71/1.47  % given #500 (A,wt=24): 313 subclass(image(A,B),range_of(restrict(A,B,universal_class))).  [resolve(139,a,93,a(flip))].
% 7.71/1.47  
% 7.71/1.47  % SZS status Unsatisfiable for theBenchmark
% 7.71/1.47  
% 7.71/1.47  % Proof 1 at 0.84 (+ 0.21) seconds.
% 7.71/1.47  % Length of proof is 10.
% 7.71/1.47  % Level of proof is 3.
% 7.71/1.47  % Maximum clause weight is 27.000.
% 7.71/1.47  % Given clauses 554.
% 7.71/1.47  
% 7.71/1.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------