↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : COL104-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n022.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 : Mon Jun 24 04:45:11 EDT 2024

% Result   : Unsatisfiable 0.22s 0.67s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.15  % Problem    : COL104-2 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.15  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.37  % Computer : n022.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Tue Jun 18 16:25:54 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.22/0.62  start to proof:theBenchmark
% 0.22/0.67  %-------------------------------------------
% 0.22/0.67  % File        :CSE---1.7
% 0.22/0.67  % Problem     :theBenchmark
% 0.22/0.67  % Transform   :cnf
% 0.22/0.67  % Format      :tptp:raw
% 0.22/0.67  % Command     :java -jar mcs_scs.jar %d %s
% 0.22/0.67  
% 0.22/0.67  % Result      :Theorem 0.000000s
% 0.22/0.67  % Output      :CNFRefutation 0.000000s
% 0.22/0.67  %-------------------------------------------
% 0.22/0.67  %------------------------------------------------------------------------------
% 0.22/0.67  % File     : COL104-2 : TPTP v8.2.0. Released v3.2.0.
% 0.22/0.67  % Domain   : Combinatory Logic
% 0.22/0.67  % Problem  : Problem about combinators
% 0.22/0.67  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.22/0.67  % English  :
% 0.22/0.67  
% 0.22/0.67  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.22/0.67  % Source   : [Pau06]
% 0.22/0.67  % Names    :
% 0.22/0.67  
% 0.22/0.67  % Status   : Unsatisfiable
% 0.22/0.67  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.22/0.67  % Syntax   : Number of clauses     :    6 (   3 unt;   0 nHn;   5 RR)
% 0.22/0.67  %            Number of literals    :   10 (   0 equ;   5 neg)
% 0.22/0.67  %            Maximal clause size   :    3 (   1 avg)
% 0.22/0.67  %            Maximal term depth    :    3 (   1 avg)
% 0.22/0.67  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.22/0.67  %            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
% 0.22/0.67  %            Number of variables   :   11 (   0 sgn)
% 0.22/0.67  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.22/0.67  
% 0.22/0.67  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.22/0.67  %            of which only a small selection are required for the refutation.
% 0.22/0.67  %            The mission is to find those few axioms, after which a refutation
% 0.22/0.67  %            can be quite easily found. This version has only the necessary
% 0.22/0.67  %            axioms.
% 0.22/0.67  %------------------------------------------------------------------------------
% 0.22/0.67  cnf(cls_conjecture_1,negated_conjecture,
% 0.22/0.67      c_in(c_Pair(v_y,v_za,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.22/0.67  
% 0.22/0.67  cnf(cls_conjecture_2,negated_conjecture,
% 0.22/0.67      c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z,v_x),c_Comb_Ocomb_Oop_A_D_D(v_z,v_y),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.22/0.67  
% 0.22/0.67  cnf(cls_conjecture_3,negated_conjecture,
% 0.22/0.67      ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_z,v_x),c_Comb_Ocomb_Oop_A_D_D(v_z,v_za),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ).
% 0.22/0.67  
% 0.22/0.67  cnf(cls_Comb_Ocontract_OAp2_0,axiom,
% 0.22/0.67      ( ~ c_in(c_Pair(V_x,V_y,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
% 0.22/0.67      | c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(V_z,V_x),c_Comb_Ocomb_Oop_A_D_D(V_z,V_y),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ) ).
% 0.22/0.67  
% 0.22/0.67  cnf(cls_Transitive__Closure_Or__into__rtrancl_0,axiom,
% 0.22/0.67      ( ~ c_in(V_p,V_r,tc_prod(T_a,T_a))
% 0.22/0.67      | c_in(V_p,c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ) ).
% 0.22/0.67  
% 0.22/0.67  cnf(cls_Transitive__Closure_Ortrancl__trans_0,axiom,
% 0.22/0.67      ( ~ c_in(c_Pair(V_b,V_c,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a))
% 0.22/0.67      | ~ c_in(c_Pair(V_a,V_b,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a))
% 0.22/0.67      | c_in(c_Pair(V_a,V_c,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ) ).
% 0.22/0.67  
% 0.22/0.67  %------------------------------------------------------------------------------
% 0.22/0.67  %-------------------------------------------
% 0.22/0.67  % Proof found
% 0.22/0.67  % SZS status Theorem for theBenchmark
% 0.22/0.67  % SZS output start Proof
% 0.22/0.68  %ClaNum:6(EqnAxiom:0)
% 0.22/0.68  %VarNum:39(SingletonVarNum:11)
% 0.22/0.68  %MaxLitNum:3
% 0.22/0.68  %MaxfuncDepth:2
% 0.22/0.68  %SharedTerms:17
% 0.22/0.68  %goalClause: 1 2 3
% 0.22/0.68  %singleGoalClaCount:3
% 0.22/0.68  [1]P1(f3(a1,a9,a2,a2),a4,f7(a2,a2))
% 0.22/0.68  [2]P1(f3(f5(a10,a8),f5(a10,a1),a2,a2),f6(a4,a2),f7(a2,a2))
% 0.22/0.68  [3]~P1(f3(f5(a10,a8),f5(a10,a9),a2,a2),f6(a4,a2),f7(a2,a2))
% 0.22/0.68  [4]~P1(x41,x42,f7(x43,x43))+P1(x41,f6(x42,x43),f7(x43,x43))
% 0.22/0.68  [5]~P1(f3(x52,x53,a2,a2),a4,f7(a2,a2))+P1(f3(f5(x51,x52),f5(x51,x53),a2,a2),a4,f7(a2,a2))
% 0.22/0.68  [6]P1(f3(x61,x62,x63,x63),f6(x64,x63),f7(x63,x63))+~P1(f3(x65,x62,x63,x63),f6(x64,x63),f7(x63,x63))+~P1(f3(x61,x65,x63,x63),f6(x64,x63),f7(x63,x63))
% 0.22/0.68  %EqnAxiom
% 0.22/0.68  
% 0.22/0.68  %-------------------------------------------
% 0.22/0.68  cnf(11,plain,
% 0.22/0.68     (~P1(f3(f5(a10,a1),f5(a10,a9),a2,a2),f6(a4,a2),f7(a2,a2))),
% 0.22/0.68     inference(scs_inference,[],[3,2,4,5,6])).
% 0.22/0.68  cnf(13,plain,
% 0.22/0.68     (~P1(f3(f5(a10,a1),f5(a10,a9),a2,a2),a4,f7(a2,a2))),
% 0.22/0.68     inference(scs_inference,[],[11,4])).
% 0.22/0.68  cnf(19,plain,
% 0.22/0.68     ($false),
% 0.22/0.68     inference(scs_inference,[],[1,13,5]),
% 0.22/0.68     ['proof']).
% 0.22/0.68  % SZS output end Proof
% 0.22/0.68  % Total time :0.000000s
%------------------------------------------------------------------------------