↑ Up

CSE---1.7.UNS-CRf.s

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

% Computer : n001.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 19:04:24 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN060-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n001.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   : Sun Jun 23 21:02:23 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.22/0.57  start to proof:theBenchmark
% 0.57/0.61  %-------------------------------------------
% 0.57/0.61  % File        :CSE---1.7
% 0.57/0.61  % Problem     :theBenchmark
% 0.57/0.61  % Transform   :cnf
% 0.57/0.61  % Format      :tptp:raw
% 0.57/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.57/0.61  
% 0.57/0.61  % Result      :Theorem 0.000000s
% 0.57/0.61  % Output      :CNFRefutation 0.000000s
% 0.57/0.61  %-------------------------------------------
% 0.57/0.61  %--------------------------------------------------------------------------
% 0.57/0.61  % File     : SYN060-1 : TPTP v8.2.0. Released v1.0.0.
% 0.57/0.61  % Domain   : Syntactic
% 0.57/0.61  % Problem  : Pelletier Problem 30
% 0.57/0.61  % Version  : Especial.
% 0.57/0.61  % English  :
% 0.57/0.61  
% 0.57/0.61  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.57/0.61  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.57/0.61  % Source   : [Pel86]
% 0.57/0.61  % Names    : Pelletier 30 [Pel86]
% 0.57/0.61  
% 0.57/0.61  % Status   : Unsatisfiable
% 0.57/0.61  % Rating   : 0.00 v2.0.0
% 0.57/0.61  % Syntax   : Number of clauses     :    7 (   1 unt;   4 nHn;   3 RR)
% 0.57/0.61  %            Number of literals    :   13 (   0 equ;   5 neg)
% 0.57/0.61  %            Maximal clause size   :    2 (   1 avg)
% 0.57/0.61  %            Maximal term depth    :    1 (   1 avg)
% 0.57/0.61  %            Number of predicates  :    4 (   4 usr;   0 prp; 1-1 aty)
% 0.57/0.61  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.57/0.61  %            Number of variables   :    6 (   0 sgn)
% 0.57/0.61  % SPC      : CNF_UNS_EPR_NEQ_NHN
% 0.57/0.61  
% 0.57/0.61  % Comments :
% 0.57/0.61  %--------------------------------------------------------------------------
% 0.57/0.61  cnf(clause_1,axiom,
% 0.57/0.61      ( ~ big_f(X)
% 0.57/0.61      | ~ big_h(X) ) ).
% 0.57/0.61  
% 0.57/0.61  cnf(clause_2,axiom,
% 0.57/0.61      ( big_g(X)
% 0.57/0.61      | big_f(X) ) ).
% 0.57/0.61  
% 0.57/0.61  cnf(clause_3,axiom,
% 0.57/0.61      ( ~ big_g(X)
% 0.57/0.61      | ~ big_h(X) ) ).
% 0.57/0.61  
% 0.57/0.61  cnf(clause_4,axiom,
% 0.57/0.61      ( big_g(X)
% 0.57/0.61      | big_h(X) ) ).
% 0.57/0.61  
% 0.57/0.61  cnf(clause_5,axiom,
% 0.57/0.61      ( big_i(X)
% 0.57/0.61      | big_f(X) ) ).
% 0.57/0.61  
% 0.57/0.61  cnf(clause_6,axiom,
% 0.57/0.61      ( big_i(X)
% 0.57/0.61      | big_h(X) ) ).
% 0.57/0.61  
% 0.57/0.61  cnf(clause_7,negated_conjecture,
% 0.57/0.61      ~ big_i(a) ).
% 0.57/0.61  
% 0.57/0.61  %--------------------------------------------------------------------------
% 0.57/0.61  %-------------------------------------------
% 0.57/0.61  % Proof found
% 0.57/0.61  % SZS status Theorem for theBenchmark
% 0.57/0.61  % SZS output start Proof
% 0.57/0.61  %ClaNum:7(EqnAxiom:0)
% 0.57/0.61  %VarNum:12(SingletonVarNum:6)
% 0.57/0.61  %MaxLitNum:2
% 0.57/0.61  %MaxfuncDepth:0
% 0.57/0.61  %SharedTerms:2
% 0.57/0.61  %goalClause: 1
% 0.57/0.61  %singleGoalClaCount:1
% 0.57/0.61  [1]~P1(a1)
% 0.57/0.61  [2]P3(x21)+P2(x21)
% 0.57/0.61  [3]P1(x31)+P2(x31)
% 0.57/0.61  [4]P3(x41)+P4(x41)
% 0.57/0.61  [5]P1(x51)+P4(x51)
% 0.57/0.61  [6]~P4(x61)+~P2(x61)
% 0.57/0.61  [7]~P3(x71)+~P4(x71)
% 0.57/0.61  %EqnAxiom
% 0.57/0.61  
% 0.57/0.61  %-------------------------------------------
% 0.57/0.62  cnf(9,plain,
% 0.57/0.62     (~P4(a1)),
% 0.57/0.62     inference(scs_inference,[],[1,3,6])).
% 0.57/0.62  cnf(10,plain,
% 0.57/0.62     ($false),
% 0.57/0.62     inference(scs_inference,[],[1,9,5]),
% 0.57/0.62     ['proof']).
% 0.57/0.62  % SZS output end Proof
% 0.57/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------