↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : COL089-1 : TPTP v9.3.1. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/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 06:57:40 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(transD,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( member(pair(VAR_1,VAR_3),VAR_0)
      | ~ member(pair(VAR_2,VAR_3),VAR_0)
      | ~ member(pair(VAR_1,VAR_2),VAR_0)
      | ~ trans(VAR_0) ),
    file('theBenchmark.p',transD) ).

cnf(c_39,plain,
    ( member(pair(B,D),A)
    | ~ member(pair(C,D),A)
    | ~ member(pair(B,C),A)
    | ~ trans(A) ),
    inference(clausify,[status(thm)],[transD]) ).

fof(trans_rtrancl,axiom,
    ! [VAR_0] : trans(rtrancl(VAR_0)),
    file('theBenchmark.p',trans_rtrancl) ).

cnf(c_40,plain,
    trans(rtrancl(A)),
    inference(clausify,[status(thm)],[trans_rtrancl]) ).

cnf(c_41,plain,
    ( member(pair(A,D),rtrancl(C))
    | ~ member(pair(B,D),rtrancl(C))
    | ~ member(pair(A,B),rtrancl(C)) ),
    inference(resolve,[status(thm)],[c_39,c_40]) ).

fof(ap_reduce2_2c1,axiom,
    ~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
    file('theBenchmark.p',ap_reduce2_2c1) ).

cnf(c_42,plain,
    ~ member(pair(comb_app(r,p),comb_app(r,z)),rtrancl(contract)),
    inference(clausify,[status(thm)],[ap_reduce2_2c1]) ).

fof(ap_reduce2_2h5,axiom,
    member(pair(comb_app(r,p),comb_app(r,y)),rtrancl(contract)),
    file('theBenchmark.p',ap_reduce2_2h5) ).

cnf(c_43,plain,
    member(pair(comb_app(r,p),comb_app(r,y)),rtrancl(contract)),
    inference(clausify,[status(thm)],[ap_reduce2_2h5]) ).

fof(ap_reduce2_2h4,axiom,
    member(pair(y,z),contract),
    file('theBenchmark.p',ap_reduce2_2h4) ).

cnf(c_44,plain,
    member(pair(y,z),contract),
    inference(clausify,[status(thm)],[ap_reduce2_2h4]) ).

fof(ap_reduce2_2h1,axiom,
    member(r,comb),
    file('theBenchmark.p',ap_reduce2_2h1) ).

cnf(c_47,plain,
    member(r,comb),
    inference(clausify,[status(thm)],[ap_reduce2_2h1]) ).

fof(contract_combD2,axiom,
    ! [VAR_0,VAR_1] :
      ( member(VAR_1,comb)
      | ~ member(pair(VAR_0,VAR_1),contract) ),
    file('theBenchmark.p',contract_combD2) ).

cnf(c_48,plain,
    ( member(B,comb)
    | ~ member(pair(A,B),contract) ),
    inference(clausify,[status(thm)],[contract_combD2]) ).

fof(reduction_rls_4,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( member(pair(comb_app(VAR_2,VAR_0),VAR_3),rtrancl(contract))
      | ~ member(pair(comb_app(VAR_2,VAR_1),VAR_3),rtrancl(contract))
      | ~ member(VAR_2,comb)
      | ~ member(pair(VAR_0,VAR_1),contract) ),
    file('theBenchmark.p',reduction_rls_4) ).

cnf(c_49,plain,
    ( member(pair(comb_app(C,A),D),rtrancl(contract))
    | ~ member(pair(comb_app(C,B),D),rtrancl(contract))
    | ~ member(C,comb)
    | ~ member(pair(A,B),contract) ),
    inference(clausify,[status(thm)],[reduction_rls_4]) ).

fof(reduction_refl,axiom,
    ! [VAR_0] :
      ( member(pair(VAR_0,VAR_0),rtrancl(contract))
      | ~ member(VAR_0,comb) ),
    file('theBenchmark.p',reduction_refl) ).

cnf(c_57,plain,
    ( member(pair(A,A),rtrancl(contract))
    | ~ member(A,comb) ),
    inference(clausify,[status(thm)],[reduction_refl]) ).

fof(comb_intros3,axiom,
    ! [VAR_0,VAR_1] :
      ( member(comb_app(VAR_0,VAR_1),comb)
      | ~ member(VAR_1,comb)
      | ~ member(VAR_0,comb) ),
    file('theBenchmark.p',comb_intros3) ).

cnf(c_58,plain,
    ( member(comb_app(A,B),comb)
    | ~ member(B,comb)
    | ~ member(A,comb) ),
    inference(clausify,[status(thm)],[comb_intros3]) ).

cnf(c_445,plain,
    ( member(pair(comb_app(r,p),A),rtrancl(contract))
    | ~ member(pair(comb_app(r,y),A),rtrancl(contract)) ),
    inference(resolve,[status(thm)],[c_41,c_43]) ).

cnf(c_176,plain,
    ~ member(pair(comb_app(r,y),comb_app(r,z)),rtrancl(contract)),
    inference(resolve,[status(thm)],[c_445,c_42]) ).

cnf(c_179,plain,
    member(z,comb),
    inference(resolve,[status(thm)],[c_48,c_44]) ).

cnf(c_207,plain,
    ( member(comb_app(r,A),comb)
    | ~ member(A,comb) ),
    inference(resolve,[status(thm)],[c_58,c_47]) ).

cnf(c_446,plain,
    ( member(pair(comb_app(A,y),B),rtrancl(contract))
    | ~ member(pair(comb_app(A,z),B),rtrancl(contract))
    | ~ member(A,comb) ),
    inference(resolve,[status(thm)],[c_49,c_44]) ).

cnf(c_447,plain,
    ( member(pair(comb_app(r,y),A),rtrancl(contract))
    | ~ member(pair(comb_app(r,z),A),rtrancl(contract)) ),
    inference(resolve,[status(thm)],[c_446,c_47]) ).

cnf(c_276,plain,
    ~ member(pair(comb_app(r,z),comb_app(r,z)),rtrancl(contract)),
    inference(resolve,[status(thm)],[c_447,c_176]) ).

cnf(c_422,plain,
    member(comb_app(r,z),comb),
    inference(resolve,[status(thm)],[c_207,c_179]) ).

cnf(c_448,plain,
    member(pair(comb_app(r,z),comb_app(r,z)),rtrancl(contract)),
    inference(resolve,[status(thm)],[c_422,c_57]) ).

cnf(c_444,plain,
    $false,
    inference(resolve,[status(thm)],[c_276,c_448]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL089-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.38   % Computer : n016.cluster.edu
% 0.09/5.38   % Model    : x86_64 x86_64
% 0.09/5.38   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38   % Memory   : 8046.5625MB
% 0.09/5.38   % OS       : Linux 6.8.0-71-generic
% 0.09/20.65  % CPULimit : 300
% 0.09/20.65  % WCLimit  : 300
% 0.09/20.65  % DateTime : Sat Sep 26 23:12:28 UTC 2026
% 0.09/20.65  % CPUTime  : 
% 0.09/20.65  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/20.65  % Process 3790705 was started by sandbox on n013,
% 0.09/20.65  % Sat Sep 26 23:12:28 2026
% 0.09/20.65  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/20.66  
% 0.09/20.66  % From the command line: assign(max_seconds, 300).
% 0.36/20.75  
% 0.36/20.75  % SZS status Unsatisfiable for theBenchmark
% 0.36/20.75  
% 0.36/20.75  % Proof 1 at 0.07 (+ 0.01) seconds.
% 0.36/20.75  % Length of proof is 17.
% 0.36/20.75  % Level of proof is 4.
% 0.36/20.75  % Maximum clause weight is 39.000.
% 0.36/20.75  % Given clauses 102.
% 0.36/20.75  
% 0.36/20.75  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------