↑ Up

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

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

% Computer : n003.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 09:38:58 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(p11_5,axiom,
    ! [VAR_0] : p11(VAR_0,VAR_0),
    file('theBenchmark.p',p11_5) ).

cnf(c_5,plain,
    p11(A,A),
    inference(clausify,[status(thm)],[p11_5]) ).

fof(p11_18,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p10(VAR_0,VAR_1)
      | p11(f12(VAR_0),f12(VAR_1)) ),
    file('theBenchmark.p',p11_18) ).

cnf(c_18,plain,
    ( ~ p10(A,B)
    | p11(f12(A),f12(B)) ),
    inference(clausify,[status(thm)],[p11_18]) ).

fof(p11_23,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p11(VAR_2,VAR_1)
      | ~ p11(VAR_2,VAR_0)
      | p11(VAR_0,VAR_1) ),
    file('theBenchmark.p',p11_23) ).

cnf(c_23,plain,
    ( ~ p11(C,B)
    | ~ p11(C,A)
    | p11(A,B) ),
    inference(clausify,[status(thm)],[p11_23]) ).

fof(p10_24,axiom,
    ! [VAR_0] : p10(f13(f6(c22),VAR_0),f13(f6(c24),f16(c26,VAR_0))),
    file('theBenchmark.p',p10_24) ).

cnf(c_24,plain,
    p10(f13(f6(c22),A),f13(f6(c24),f16(c26,A))),
    inference(clausify,[status(thm)],[p10_24]) ).

fof(p20_28,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p11(VAR_3,VAR_0)
      | ~ p20(VAR_3,VAR_2)
      | ~ p11(VAR_2,VAR_1)
      | p20(VAR_0,VAR_1) ),
    file('theBenchmark.p',p20_28) ).

cnf(c_28,plain,
    ( ~ p11(D,A)
    | ~ p20(D,C)
    | ~ p11(C,B)
    | p20(A,B) ),
    inference(clausify,[status(thm)],[p20_28]) ).

fof(p20_32,axiom,
    ! [VAR_0] : p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c24),VAR_0))),
    file('theBenchmark.p',p20_32) ).

cnf(c_32,plain,
    p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c24),A))),
    inference(clausify,[status(thm)],[p20_32]) ).

fof(not_p20_33,axiom,
    ~ p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c22),c27))),
    file('theBenchmark.p',not_p20_33) ).

cnf(c_33,plain,
    ~ p20(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c22),c27))),
    inference(clausify,[status(thm)],[not_p20_33]) ).

cnf(c_52,plain,
    p11(f12(f13(f6(c22),A)),f12(f13(f6(c24),f16(c26,A)))),
    inference(resolve,[status(thm)],[c_24,c_18]) ).

cnf(c_72,plain,
    ( ~ p11(B,f12(f13(f6(c22),f14(f15(f7(c25))))))
    | ~ p20(B,A)
    | ~ p11(A,f12(f13(f6(c22),c27))) ),
    inference(resolve,[status(thm)],[c_28,c_33]) ).

cnf(c_73,plain,
    ( ~ p11(f12(f13(f6(c22),f14(f15(f7(c25))))),f12(f13(f6(c22),f14(f15(f7(c25))))))
    | ~ p11(f12(f13(f6(c24),A)),f12(f13(f6(c22),c27))) ),
    inference(resolve,[status(thm)],[c_72,c_32]) ).

cnf(c_62,plain,
    ~ p11(f12(f13(f6(c24),A)),f12(f13(f6(c22),c27))),
    inference(resolve,[status(thm)],[c_73,c_5]) ).

cnf(c_74,plain,
    ( ~ p11(A,f12(f13(f6(c22),c27)))
    | ~ p11(A,f12(f13(f6(c24),B))) ),
    inference(resolve,[status(thm)],[c_23,c_62]) ).

cnf(c_70,plain,
    ~ p11(f12(f13(f6(c22),c27)),f12(f13(f6(c24),A))),
    inference(resolve,[status(thm)],[c_74,c_5]) ).

cnf(c_71,plain,
    $false,
    inference(resolve,[status(thm)],[c_70,c_52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN620-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n003.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 : Sat Sep 26 18:18:24 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 3492138 was started by sandbox on n003,
% 0.09/0.37  % Sat Sep 26 18:18:24 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37  
% 0.09/0.37  % From the command line: assign(max_seconds, 300).
% 0.09/0.39  
% 0.09/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39  
% 0.09/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39  % Length of proof is 11.
% 0.09/0.39  % Level of proof is 3.
% 0.09/0.39  % Maximum clause weight is 14.000.
% 0.09/0.39  % Given clauses 40.
% 0.09/0.39  
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------