↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN082-1 : 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 : n015.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:37:00 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.38s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   47 (  21   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(clause_1,axiom,
    ! [VAR_0] :
      ( big_f(VAR_0,f(a))
      | ~ big_f(VAR_0,b)
      | big_f(a,f(a)) ),
    file('theBenchmark.p',clause_1) ).

cnf(c_1,plain,
    ( big_f(A,f(a))
    | ~ big_f(A,b)
    | big_f(a,f(a)) ),
    inference(clausify,[status(thm)],[clause_1]) ).

fof(clause_2,axiom,
    ( big_f(a,b)
    | big_f(a,f(a)) ),
    file('theBenchmark.p',clause_2) ).

cnf(c_2,plain,
    ( big_f(a,b)
    | big_f(a,f(a)) ),
    inference(clausify,[status(thm)],[clause_2]) ).

fof(clause_4,axiom,
    ! [VAR_0] :
      ( big_f(a,b)
      | ~ big_f(a,VAR_0)
      | big_f(g(VAR_0),VAR_0) ),
    file('theBenchmark.p',clause_4) ).

cnf(c_4,plain,
    ( big_f(a,b)
    | ~ big_f(a,A)
    | big_f(g(A),A) ),
    inference(clausify,[status(thm)],[clause_4]) ).

fof(clause_5,axiom,
    ! [VAR_0] :
      ( ~ big_f(a,f(a))
      | ~ big_f(a,VAR_0)
      | big_f(g(VAR_0),VAR_0) ),
    file('theBenchmark.p',clause_5) ).

cnf(c_5,plain,
    ( ~ big_f(a,f(a))
    | ~ big_f(a,A)
    | big_f(g(A),A) ),
    inference(clausify,[status(thm)],[clause_5]) ).

fof(clause_8,axiom,
    ! [VAR_0] :
      ( ~ big_f(a,f(a))
      | ~ big_f(a,VAR_0)
      | ~ big_f(g(VAR_0),VAR_0) ),
    file('theBenchmark.p',clause_8) ).

cnf(c_8,plain,
    ( ~ big_f(a,f(a))
    | ~ big_f(a,A)
    | ~ big_f(g(A),A) ),
    inference(clausify,[status(thm)],[clause_8]) ).

cnf(c_9,plain,
    ( ~ big_f(a,b)
    | big_f(a,f(a)) ),
    inference(factor,[status(thm)],[c_1]) ).

cnf(c_10,plain,
    ( ~ big_f(a,f(a))
    | big_f(g(f(a)),f(a)) ),
    inference(factor,[status(thm)],[c_5]) ).

cnf(c_12,plain,
    ( ~ big_f(a,f(a))
    | ~ big_f(g(f(a)),f(a)) ),
    inference(factor,[status(thm)],[c_8]) ).

cnf(c_22,plain,
    ( big_f(a,b)
    | big_f(a,b)
    | big_f(g(f(a)),f(a)) ),
    inference(resolve,[status(thm)],[c_4,c_2]) ).

cnf(c_15,plain,
    ( big_f(a,b)
    | big_f(g(f(a)),f(a)) ),
    inference(copy,[status(thm)],[c_22]) ).

cnf(c_16,plain,
    ( ~ big_f(a,f(a))
    | big_f(a,b) ),
    inference(resolve,[status(thm)],[c_15,c_12]) ).

cnf(c_23,plain,
    ( big_f(a,b)
    | big_f(a,b) ),
    inference(resolve,[status(thm)],[c_16,c_2]) ).

cnf(c_17,plain,
    big_f(a,b),
    inference(copy,[status(thm)],[c_23]) ).

cnf(c_19,plain,
    big_f(a,f(a)),
    inference(resolve,[status(thm)],[c_17,c_9]) ).

cnf(c_20,plain,
    ~ big_f(g(f(a)),f(a)),
    inference(resolve,[status(thm)],[c_19,c_12]) ).

cnf(c_24,plain,
    ~ big_f(a,f(a)),
    inference(resolve,[status(thm)],[c_20,c_10]) ).

cnf(c_21,plain,
    $false,
    inference(resolve,[status(thm)],[c_19,c_24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n015.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep 26 17:13:59 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 361543 was started by sandbox on n015,
% 0.10/0.37  % Sat Sep 26 17:13:59 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37  
% 0.10/0.37  % From the command line: assign(max_seconds, 300).
% 0.15/0.38  
% 0.15/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.38  
% 0.15/0.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.38  % Length of proof is 14.
% 0.15/0.38  % Level of proof is 6.
% 0.15/0.38  % Maximum clause weight is 11.000.
% 0.15/0.38  % Given clauses 14.
% 0.15/0.38  
% 0.15/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------