TSTP Solution File: LAT273-2 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : LAT273-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 05:57:57 EDT 2023

% Result   : Unsatisfiable 0.15s 0.52s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : LAT273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit   : 300
% 0.11/0.30  % WCLimit    : 300
% 0.11/0.30  % DateTime   : Thu Aug 24 07:20:56 EDT 2023
% 0.11/0.30  % CPUTime    : 
% 0.15/0.48  start to proof:theBenchmark
% 0.15/0.52  %-------------------------------------------
% 0.15/0.52  % File        :CSE---1.6
% 0.15/0.52  % Problem     :theBenchmark
% 0.15/0.52  % Transform   :cnf
% 0.15/0.52  % Format      :tptp:raw
% 0.15/0.52  % Command     :java -jar mcs_scs.jar %d %s
% 0.15/0.52  
% 0.15/0.52  % Result      :Theorem 0.000000s
% 0.15/0.52  % Output      :CNFRefutation 0.000000s
% 0.15/0.52  %-------------------------------------------
% 0.15/0.52  %------------------------------------------------------------------------------
% 0.15/0.52  % File     : LAT273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.15/0.52  % Domain   : Analysis
% 0.15/0.52  % Problem  : Problem about Tarski's fixed point theorem
% 0.15/0.52  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.15/0.52  % English  :
% 0.15/0.52  
% 0.15/0.52  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.15/0.52  % Source   : [Pau06]
% 0.15/0.52  % Names    :
% 0.15/0.52  
% 0.15/0.52  % Status   : Unsatisfiable
% 0.15/0.52  % Rating   : 0.00 v4.0.0, 0.29 v3.4.0, 0.25 v3.3.0, 0.33 v3.2.0
% 0.15/0.52  % Syntax   : Number of clauses     :    7 (   4 unt;   1 nHn;   7 RR)
% 0.15/0.52  %            Number of literals    :   15 (   0 equ;   8 neg)
% 0.15/0.52  %            Maximal clause size   :    4 (   2 avg)
% 0.15/0.52  %            Maximal term depth    :    3 (   1 avg)
% 0.15/0.52  %            Number of predicates  :    3 (   3 usr;   0 prp; 3-4 aty)
% 0.15/0.52  %            Number of functors    :   13 (  13 usr;   8 con; 0-4 aty)
% 0.15/0.52  %            Number of variables   :   12 (   1 sgn)
% 0.15/0.52  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.15/0.52  
% 0.15/0.52  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.15/0.52  %            of which only a small selection are required for the refutation.
% 0.15/0.52  %            The mission is to find those few axioms, after which a refutation
% 0.15/0.52  %            can be quite easily found. This version has only the necessary
% 0.15/0.52  %            axioms.
% 0.15/0.52  %------------------------------------------------------------------------------
% 0.15/0.52  cnf(cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
% 0.15/0.52      ( ~ c_in(V_x,V_S,T_a)
% 0.15/0.52      | ~ c_lessequals(V_S,c_Tarski_Ointerval(V_r,V_a,V_b,T_a),tc_set(T_a))
% 0.15/0.52      | c_in(c_Pair(V_x,V_b,T_a,T_a),V_r,tc_prod(T_a,T_a)) ) ).
% 0.15/0.52  
% 0.15/0.52  cnf(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0,axiom,
% 0.15/0.52      ( ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a)
% 0.15/0.52      | ~ c_in(V_z,v_A,t_a)
% 0.15/0.52      | c_in(c_Pair(V_L,V_z,t_a,t_a),v_r,tc_prod(t_a,t_a))
% 0.15/0.52      | c_in(v_sko__4mi(V_S,v_r,V_z),V_S,t_a) ) ).
% 0.15/0.52  
% 0.15/0.52  cnf(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1,axiom,
% 0.15/0.52      ( ~ c_Tarski_OisLub(V_S,v_cl,V_L,t_a)
% 0.15/0.52      | ~ c_in(V_z,v_A,t_a)
% 0.15/0.52      | ~ c_in(c_Pair(v_sko__4mi(V_S,v_r,V_z),V_z,t_a,t_a),v_r,tc_prod(t_a,t_a))
% 0.15/0.52      | c_in(c_Pair(V_L,V_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) ) ).
% 0.15/0.52  
% 0.15/0.52  cnf(cls_conjecture_1,negated_conjecture,
% 0.15/0.52      c_in(v_b,v_A,t_a) ).
% 0.15/0.52  
% 0.15/0.52  cnf(cls_conjecture_2,negated_conjecture,
% 0.15/0.52      c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)) ).
% 0.15/0.52  
% 0.15/0.52  cnf(cls_conjecture_4,negated_conjecture,
% 0.15/0.52      c_Tarski_OisLub(v_S,v_cl,v_L,t_a) ).
% 0.15/0.52  
% 0.15/0.52  cnf(cls_conjecture_6,negated_conjecture,
% 0.15/0.52      ~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) ).
% 0.15/0.52  
% 0.15/0.52  %------------------------------------------------------------------------------
% 0.15/0.52  %-------------------------------------------
% 0.15/0.52  % Proof found
% 0.15/0.52  % SZS status Theorem for theBenchmark
% 0.15/0.52  % SZS output start Proof
% 0.15/0.52  %ClaNum:7(EqnAxiom:0)
% 0.15/0.52  %VarNum:32(SingletonVarNum:12)
% 0.15/0.52  %MaxLitNum:4
% 0.15/0.52  %MaxfuncDepth:2
% 0.15/0.52  %SharedTerms:16
% 0.15/0.52  %goalClause: 1 2 3 4
% 0.15/0.52  %singleGoalClaCount:4
% 0.15/0.52  [1]P1(a1,a2,a3)
% 0.15/0.52  [2]P2(a8,a11,a9,a3)
% 0.15/0.52  [3]P3(a8,f4(a12,a10,a1,a3),f6(a3))
% 0.15/0.52  [4]~P1(f5(a9,a1,a3,a3),a12,f7(a3,a3))
% 0.15/0.52  [6]~P1(x61,x65,x63)+P1(f5(x61,x62,x63,x63),x64,f7(x63,x63))+~P3(x65,f4(x64,x66,x62,x63),f6(x63))
% 0.15/0.52  [5]~P2(x51,a11,x53,a3)+~P1(x52,a2,a3)+P1(f13(x51,a12,x52),x51,a3)+P1(f5(x53,x52,a3,a3),a12,f7(a3,a3))
% 0.15/0.52  [7]~P2(x73,a11,x71,a3)+~P1(x72,a2,a3)+P1(f5(x71,x72,a3,a3),a12,f7(a3,a3))+~P1(f5(f13(x73,a12,x72),x72,a3,a3),a12,f7(a3,a3))
% 0.15/0.52  %EqnAxiom
% 0.15/0.52  
% 0.15/0.52  %-------------------------------------------
% 0.15/0.53  cnf(9,plain,
% 0.15/0.53     (P1(f13(a8,a12,a1),a8,a3)),
% 0.15/0.53     inference(scs_inference,[],[1,2,3,4,6,5])).
% 0.15/0.53  cnf(10,plain,
% 0.15/0.53     (~P1(f5(f13(a8,a12,a1),a1,a3,a3),a12,f7(a3,a3))),
% 0.15/0.53     inference(scs_inference,[],[1,2,3,4,6,5,7])).
% 0.15/0.53  cnf(11,plain,
% 0.15/0.53     ($false),
% 0.15/0.53     inference(scs_inference,[],[3,10,9,6]),
% 0.15/0.53     ['proof']).
% 0.15/0.53  % SZS output end Proof
% 0.15/0.53  % Total time :0.000000s
%------------------------------------------------------------------------------