↑ Up

CSE---1.7.UNS-CRf.s

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

% Computer : n012.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 10:08:14 EDT 2024

% Result   : Unsatisfiable 0.54s 0.62s
% Output   : CNFRefutation 0.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KRS012-1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33  % Computer : n012.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Wed Jun 19 12:28:39 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.54/0.61  %-------------------------------------------
% 0.54/0.61  % File        :CSE---1.7
% 0.54/0.61  % Problem     :theBenchmark
% 0.54/0.61  % Transform   :cnf
% 0.54/0.61  % Format      :tptp:raw
% 0.54/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.54/0.61  
% 0.54/0.61  % Result      :Theorem 0.010000s
% 0.54/0.61  % Output      :CNFRefutation 0.010000s
% 0.54/0.61  %-------------------------------------------
% 0.54/0.62  %--------------------------------------------------------------------------
% 0.54/0.62  % File     : KRS012-1 : TPTP v8.2.0. Released v2.0.0.
% 0.54/0.62  % Domain   : Knowledge Representation
% 0.54/0.62  % Problem  : Paramasivam problem T-Box 4a
% 0.54/0.62  % Version  : Especial.
% 0.54/0.62  % English  : f subsumes c.
% 0.54/0.62  
% 0.54/0.62  % Refs     : [PP95]  Paramasivam & Plaisted (1995), Automated Deduction Tec
% 0.54/0.62  % Source   : [PP95]
% 0.54/0.62  % Names    : Problem 4(a) [PP95]
% 0.54/0.62  
% 0.54/0.62  % Status   : Unsatisfiable
% 0.54/0.62  % Rating   : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v2.1.0
% 0.54/0.62  % Syntax   : Number of clauses     :   13 (   2 unt;   6 nHn;  10 RR)
% 0.54/0.62  %            Number of literals    :   34 (   0 equ;  14 neg)
% 0.54/0.62  %            Maximal clause size   :    4 (   2 avg)
% 0.54/0.62  %            Maximal term depth    :    2 (   1 avg)
% 0.54/0.62  %            Number of predicates  :    5 (   5 usr;   0 prp; 1-2 aty)
% 0.54/0.62  %            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
% 0.54/0.62  %            Number of variables   :   14 (   0 sgn)
% 0.54/0.62  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.54/0.62  
% 0.54/0.62  % Comments :
% 0.54/0.62  %--------------------------------------------------------------------------
% 0.54/0.62  cnf(clause_1,negated_conjecture,
% 0.54/0.62      c(exists) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_2,negated_conjecture,
% 0.54/0.62      ~ f(exists) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_3,axiom,
% 0.54/0.62      ( e(X3)
% 0.54/0.62      | ~ c(X1)
% 0.54/0.62      | ~ r(X1,X3)
% 0.54/0.62      | ~ d(X3) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_4,axiom,
% 0.54/0.62      ( d(X2)
% 0.54/0.62      | ~ c(X1)
% 0.54/0.62      | ~ r(X1,X2) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_5,axiom,
% 0.54/0.62      ( c(X1)
% 0.54/0.62      | ~ d(u0r1(X1))
% 0.54/0.62      | ~ e(u0r2(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_6,axiom,
% 0.54/0.62      ( c(X1)
% 0.54/0.62      | d(u0r2(X1))
% 0.54/0.62      | ~ d(u0r1(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_7,axiom,
% 0.54/0.62      ( c(X1)
% 0.54/0.62      | r(X1,u0r2(X1))
% 0.54/0.62      | ~ d(u0r1(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_8,axiom,
% 0.54/0.62      ( c(X1)
% 0.54/0.62      | r(X1,u0r1(X1))
% 0.54/0.62      | ~ e(u0r2(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_9,axiom,
% 0.54/0.62      ( c(X1)
% 0.54/0.62      | r(X1,u0r1(X1))
% 0.54/0.62      | d(u0r2(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_10,axiom,
% 0.54/0.62      ( c(X1)
% 0.54/0.62      | r(X1,u0r1(X1))
% 0.54/0.62      | r(X1,u0r2(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_11,axiom,
% 0.54/0.62      ( e(X2)
% 0.54/0.62      | ~ f(X1)
% 0.54/0.62      | ~ r(X1,X2) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_12,axiom,
% 0.54/0.62      ( f(X1)
% 0.54/0.62      | ~ e(u1r1(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  cnf(clause_13,axiom,
% 0.54/0.62      ( f(X1)
% 0.54/0.62      | r(X1,u1r1(X1)) ) ).
% 0.54/0.62  
% 0.54/0.62  %--------------------------------------------------------------------------
% 0.54/0.62  %-------------------------------------------
% 0.54/0.62  % Proof found
% 0.54/0.62  % SZS status Theorem for theBenchmark
% 0.54/0.62  % SZS output start Proof
% 0.54/0.62  %ClaNum:13(EqnAxiom:0)
% 0.54/0.62  %VarNum:41(SingletonVarNum:14)
% 0.54/0.62  %MaxLitNum:4
% 0.54/0.62  %MaxfuncDepth:1
% 0.54/0.62  %SharedTerms:3
% 0.54/0.62  %goalClause: 1 2
% 0.54/0.62  %singleGoalClaCount:2
% 0.54/0.62  [1]P1(a1)
% 0.54/0.62  [2]~P2(a1)
% 0.54/0.62  [3]P2(x31)+~P3(f2(x31))
% 0.54/0.62  [4]P2(x41)+P5(x41,f2(x41))
% 0.54/0.62  [5]P1(x51)+P4(f3(x51))+~P4(f4(x51))
% 0.54/0.62  [8]P1(x81)+P5(x81,f4(x81))+P4(f3(x81))
% 0.54/0.62  [9]P1(x91)+~P3(f3(x91))+~P4(f4(x91))
% 0.54/0.62  [11]P1(x111)+P5(x111,f4(x111))+~P3(f3(x111))
% 0.54/0.62  [12]P1(x121)+P5(x121,f3(x121))+~P4(f4(x121))
% 0.54/0.62  [13]P1(x131)+P5(x131,f4(x131))+P5(x131,f3(x131))
% 0.54/0.62  [6]~P5(x62,x61)+P3(x61)+~P2(x62)
% 0.54/0.62  [7]~P5(x72,x71)+P4(x71)+~P1(x72)
% 0.54/0.62  [10]~P4(x101)+~P5(x102,x101)+P3(x101)+~P1(x102)
% 0.54/0.62  %EqnAxiom
% 0.54/0.62  
% 0.54/0.62  %-------------------------------------------
% 0.57/0.62  cnf(15,plain,
% 0.57/0.62     (P3(x151)+~P5(x152,x151)+P5(x152,f2(x152))),
% 0.57/0.62     inference(scs_inference,[],[4,6])).
% 0.57/0.62  cnf(19,plain,
% 0.57/0.62     (P4(f2(a1))+P3(x191)+~P5(a1,x191)),
% 0.57/0.62     inference(scs_inference,[],[1,15,7])).
% 0.57/0.62  cnf(20,plain,
% 0.57/0.62     (P4(f2(a1))+~P5(a1,f2(a1))),
% 0.57/0.62     inference(scs_inference,[],[2,19,3])).
% 0.57/0.62  cnf(21,plain,
% 0.57/0.62     (P3(f2(a1))+~P5(a1,f2(a1))),
% 0.57/0.62     inference(scs_inference,[],[1,20,10])).
% 0.57/0.62  cnf(22,plain,
% 0.57/0.62     (P3(f2(a1))),
% 0.57/0.62     inference(scs_inference,[],[2,21,4])).
% 0.57/0.62  cnf(23,plain,
% 0.57/0.62     ($false),
% 0.57/0.62     inference(scs_inference,[],[2,22,3]),
% 0.57/0.62     ['proof']).
% 0.57/0.62  % SZS output end Proof
% 0.57/0.62  % Total time :0.010000s
%------------------------------------------------------------------------------