↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : KRS004-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 : n011.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:13 EDT 2024

% Result   : Unsatisfiable 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : KRS004-1 : TPTP v8.2.0. Released v2.0.0.
% 0.08/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Jun 19 12:27:39 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.20/0.59  %-------------------------------------------
% 0.20/0.59  % File        :CSE---1.7
% 0.20/0.59  % Problem     :theBenchmark
% 0.20/0.59  % Transform   :cnf
% 0.20/0.59  % Format      :tptp:raw
% 0.20/0.59  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.59  
% 0.20/0.59  % Result      :Theorem 0.000000s
% 0.20/0.59  % Output      :CNFRefutation 0.000000s
% 0.20/0.59  %-------------------------------------------
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  % File     : KRS004-1 : TPTP v8.2.0. Released v2.0.0.
% 0.20/0.60  % Domain   : Knowledge Representation
% 0.20/0.60  % Problem  : Paramasivam problem T-Box 1d
% 0.20/0.60  % Version  : Especial.
% 0.20/0.60  % English  : c exists.
% 0.20/0.60  
% 0.20/0.60  % Refs     : [PP95]  Paramasivam & Plaisted (1995), Automated Deduction Tec
% 0.20/0.60  % Source   : [PP95]
% 0.20/0.60  % Names    : Problem 1(d) [PP95]
% 0.20/0.60  
% 0.20/0.60  % Status   : Unsatisfiable
% 0.20/0.60  % Rating   : 0.00 v2.1.0
% 0.20/0.60  % Syntax   : Number of clauses     :    4 (   1 unt;   0 nHn;   4 RR)
% 0.20/0.60  %            Number of literals    :    7 (   0 equ;   5 neg)
% 0.20/0.60  %            Maximal clause size   :    2 (   1 avg)
% 0.20/0.60  %            Maximal term depth    :    1 (   1 avg)
% 0.20/0.60  %            Number of predicates  :    2 (   2 usr;   0 prp; 1-1 aty)
% 0.20/0.60  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.20/0.60  %            Number of variables   :    3 (   0 sgn)
% 0.20/0.60  % SPC      : CNF_UNS_EPR_NEQ_HRN
% 0.20/0.60  
% 0.20/0.60  % Comments :
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  cnf(clause_1,negated_conjecture,
% 0.20/0.60      c(exist) ).
% 0.20/0.60  
% 0.20/0.60  cnf(clause_2,axiom,
% 0.20/0.60      ( d(X1)
% 0.20/0.60      | ~ c(X1) ) ).
% 0.20/0.60  
% 0.20/0.60  cnf(clause_3,axiom,
% 0.20/0.60      ( ~ c(X1)
% 0.20/0.60      | ~ d(X1) ) ).
% 0.20/0.60  
% 0.20/0.60  cnf(clause_4,axiom,
% 0.20/0.60      ( ~ d(X1)
% 0.20/0.60      | ~ c(X1) ) ).
% 0.20/0.60  
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark
% 0.20/0.60  % SZS output start Proof
% 0.20/0.60  %ClaNum:4(EqnAxiom:0)
% 0.20/0.60  %VarNum:4(SingletonVarNum:2)
% 0.20/0.60  %MaxLitNum:2
% 0.20/0.60  %MaxfuncDepth:0
% 0.20/0.60  %SharedTerms:2
% 0.20/0.60  %goalClause: 1
% 0.20/0.60  %singleGoalClaCount:1
% 0.20/0.60  [1]P1(a1)
% 0.20/0.60  [2]~P1(x21)+P2(x21)
% 0.20/0.60  [4]~P2(x41)+~P1(x41)
% 0.20/0.60  %EqnAxiom
% 0.20/0.60  
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  cnf(7,plain,
% 0.20/0.60     ($false),
% 0.20/0.60     inference(scs_inference,[],[1,4,2]),
% 0.20/0.60     ['proof']).
% 0.20/0.60  % SZS output end Proof
% 0.20/0.60  % Total time :0.000000s
%------------------------------------------------------------------------------