↑ Up

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

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

% Computer : n010.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:33 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(b_definition,axiom,
    ! [VAR_0,VAR_1,VAR_2] : apply(apply(apply(b,VAR_0),VAR_1),VAR_2) = apply(VAR_0,apply(VAR_1,VAR_2)),
    file('theBenchmark.p',b_definition) ).

cnf(c_1,plain,
    apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)),
    inference(clausify,[status(thm)],[b_definition]) ).

fof(t_definition,axiom,
    ! [VAR_0,VAR_1] : apply(apply(t,VAR_0),VAR_1) = apply(VAR_1,VAR_0),
    file('theBenchmark.p',t_definition) ).

cnf(c_2,plain,
    apply(apply(t,A),B) = apply(B,A),
    inference(clausify,[status(thm)],[t_definition]) ).

fof(prove_q1_combinator,axiom,
    apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,t)),b)),b),x),y),z) != apply(x,apply(z,y)),
    file('theBenchmark.p',prove_q1_combinator) ).

cnf(c_3,plain,
    apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,t)),b)),b),x),y),z) != apply(x,apply(z,y)),
    inference(clausify,[status(thm)],[prove_q1_combinator]) ).

cnf(c_13,plain,
    apply(apply(apply(apply(apply(b,apply(t,t)),b),apply(b,x)),y),z) != apply(x,apply(z,y)),
    inference(paramod,[status(thm)],[c_1,c_3]) ).

cnf(c_4,plain,
    apply(apply(apply(apply(t,t),apply(b,apply(b,x))),y),z) != apply(x,apply(z,y)),
    inference(paramod,[status(thm)],[c_1,c_13]) ).

cnf(c_14,plain,
    apply(apply(apply(b,A),apply(t,B)),C) = apply(A,apply(C,B)),
    inference(paramod,[status(thm)],[c_2,c_1]) ).

cnf(c_5,plain,
    apply(A,apply(apply(t,B),C)) = apply(A,apply(C,B)),
    inference(paramod,[status(thm)],[c_1,c_14]) ).

cnf(c_7,plain,
    apply(apply(apply(t,A),apply(b,B)),C) = apply(B,apply(A,C)),
    inference(paramod,[status(thm)],[c_2,c_1]) ).

cnf(c_15,plain,
    apply(apply(apply(b,x),apply(t,y)),z) != apply(x,apply(z,y)),
    inference(paramod,[status(thm)],[c_7,c_4]) ).

cnf(c_11,plain,
    apply(x,apply(apply(t,y),z)) != apply(x,apply(z,y)),
    inference(paramod,[status(thm)],[c_1,c_15]) ).

cnf(c_12,plain,
    $false,
    inference(resolve,[status(thm)],[c_11,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : COL061-3 : TPTP v9.3.1. Bugfixed v1.2.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/5.44  % Computer : n010.cluster.edu
% 0.18/5.44  % Model    : x86_64 x86_64
% 0.18/5.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44  % Memory   : 8046.5625MB
% 0.18/5.44  % OS       : Linux 6.8.0-71-generic
% 0.18/5.44  % CPULimit : 300
% 0.18/5.44  % WCLimit  : 300
% 0.18/5.44  % DateTime : Sat Sep 26 23:10:37 UTC 2026
% 0.18/5.45  % CPUTime  : 
% 0.18/5.45  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/5.45  % Process 273973 was started by sandbox on n010,
% 0.18/5.45  % Sat Sep 26 23:10:37 2026
% 0.18/5.45  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/5.46  
% 0.18/5.46  % From the command line: assign(max_seconds, 300).
% 0.18/5.47  
% 0.18/5.47  % SZS status Unsatisfiable for theBenchmark
% 0.18/5.47  
% 0.18/5.47  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/5.47  % Length of proof is 8.
% 0.18/5.47  % Level of proof is 3.
% 0.18/5.47  % Maximum clause weight is 19.000.
% 0.18/5.47  % Given clauses 2.
% 0.18/5.47  
% 0.18/5.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------