↑ Up

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

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

% Computer : n004.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 07:49:55 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
    v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
    file('theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).

cnf(c_2248,plain,
    v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
    inference(clausify,[status(thm)],[cls_Tarski_OA_A_61_61_Apset_Acl_0]) ).

cnf(c_2249,plain,
    c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
    inference(copy,[status(thm)],[c_2248]) ).

fof(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
    ! [VAR_0,VAR_1] : c_Tarski_Opotype_Opset(c_Tarski_Odual(VAR_0,VAR_1),VAR_1,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(VAR_0,VAR_1,tc_Product__Type_Ounit),
    file('theBenchmark.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).

cnf(c_2258,plain,
    c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),
    inference(clausify,[status(thm)],[cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0]) ).

fof(cls_conjecture_0,axiom,
    c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(c_2259,plain,
    c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    inference(clausify,[status(thm)],[cls_conjecture_0]) ).

cnf(c_2260,plain,
    c_lessequals(v_S,v_A,tc_set(t_a)),
    inference(paramod,[status(thm)],[c_2249,c_2259]) ).

fof(cls_conjecture_1,axiom,
    ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(c_2261,plain,
    ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    inference(clausify,[status(thm)],[cls_conjecture_1]) ).

cnf(c_2263,plain,
    ~ c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
    inference(paramod,[status(thm)],[c_2258,c_2261]) ).

cnf(c_2264,plain,
    ~ c_lessequals(v_S,v_A,tc_set(t_a)),
    inference(paramod,[status(thm)],[c_2249,c_2263]) ).

cnf(c_2262,plain,
    $false,
    inference(resolve,[status(thm)],[c_2260,c_2264]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT262-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.38  % Computer : n004.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Fri Sep 25 20:21:35 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 0.10/10.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/10.38  % Process 4011818 was started by sandbox on n004,
% 0.10/10.38  % Fri Sep 25 20:21:35 2026
% 0.10/10.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/10.46  
% 0.14/10.46  % From the command line: assign(max_seconds, 300).
% 23.41/13.48  
% 23.41/13.48  % SZS status Unsatisfiable for theBenchmark
% 23.41/13.48  
% 23.41/13.48  % Proof 1 at 2.97 (+ 0.03) seconds.
% 23.41/13.48  % Length of proof is 7.
% 23.41/13.48  % Level of proof is 3.
% 23.41/13.48  % Maximum clause weight is 26.000.
% 23.41/13.48  % Given clauses 0.
% 23.41/13.48  
% 23.41/13.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------