TSTP Solution File: SYN061-1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SYN061-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n024.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 : Fri Sep  1 01:43:56 EDT 2023

% Result   : Unsatisfiable 0.21s 0.63s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : SYN061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat Aug 26 16:56:24 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.58  start to proof:theBenchmark
% 0.21/0.62  %-------------------------------------------
% 0.21/0.62  % File        :CSE---1.6
% 0.21/0.62  % Problem     :theBenchmark
% 0.21/0.62  % Transform   :cnf
% 0.21/0.62  % Format      :tptp:raw
% 0.21/0.62  % Command     :java -jar mcs_scs.jar %d %s
% 0.21/0.62  
% 0.21/0.62  % Result      :Theorem 0.000000s
% 0.21/0.62  % Output      :CNFRefutation 0.000000s
% 0.21/0.62  %-------------------------------------------
% 0.21/0.63  %--------------------------------------------------------------------------
% 0.21/0.63  % File     : SYN061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.21/0.63  % Domain   : Syntactic
% 0.21/0.63  % Problem  : Pelletier Problem 31
% 0.21/0.63  % Version  : Especial.
% 0.21/0.63  % English  :
% 0.21/0.63  
% 0.21/0.63  % Refs     : [KM64]  Kalish & Montegue (1964), Logic: Techniques of Formal
% 0.21/0.63  %          : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.21/0.63  % Source   : [Pel86]
% 0.21/0.63  % Names    : Pelletier 31 [Pel86]
% 0.21/0.63  
% 0.21/0.63  % Status   : Unsatisfiable
% 0.21/0.63  % Rating   : 0.00 v2.0.0
% 0.21/0.63  % Syntax   : Number of clauses     :    6 (   2 unt;   1 nHn;   5 RR)
% 0.21/0.63  %            Number of literals    :   10 (   0 equ;   6 neg)
% 0.21/0.63  %            Maximal clause size   :    2 (   1 avg)
% 0.21/0.63  %            Maximal term depth    :    1 (   1 avg)
% 0.21/0.63  %            Number of predicates  :    5 (   5 usr;   0 prp; 1-1 aty)
% 0.21/0.63  %            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
% 0.21/0.63  %            Number of variables   :    4 (   0 sgn)
% 0.21/0.63  % SPC      : CNF_UNS_EPR_NEQ_NHN
% 0.21/0.63  
% 0.21/0.63  % Comments :
% 0.21/0.63  %--------------------------------------------------------------------------
% 0.21/0.63  cnf(clause_1,axiom,
% 0.21/0.63      ( ~ big_f(X)
% 0.21/0.63      | ~ big_g(X) ) ).
% 0.21/0.63  
% 0.21/0.63  cnf(clause_2,axiom,
% 0.21/0.63      ( ~ big_f(X)
% 0.21/0.63      | ~ big_h(X) ) ).
% 0.21/0.63  
% 0.21/0.63  cnf(clause_3,axiom,
% 0.21/0.63      big_i(a) ).
% 0.21/0.63  
% 0.21/0.63  cnf(clause_4,axiom,
% 0.21/0.63      big_f(a) ).
% 0.21/0.63  
% 0.21/0.63  cnf(clause_5,axiom,
% 0.21/0.63      ( big_h(X)
% 0.21/0.63      | big_j(X) ) ).
% 0.21/0.63  
% 0.21/0.63  cnf(clause_6,negated_conjecture,
% 0.21/0.63      ( ~ big_i(X)
% 0.21/0.63      | ~ big_j(X) ) ).
% 0.21/0.63  
% 0.21/0.63  %--------------------------------------------------------------------------
% 0.21/0.63  %-------------------------------------------
% 0.21/0.63  % Proof found
% 0.21/0.63  % SZS status Theorem for theBenchmark
% 0.21/0.63  % SZS output start Proof
% 0.21/0.63  %ClaNum:6(EqnAxiom:0)
% 0.21/0.63  %VarNum:8(SingletonVarNum:4)
% 0.21/0.63  %MaxLitNum:2
% 0.21/0.63  %MaxfuncDepth:0
% 0.21/0.63  %SharedTerms:3
% 0.21/0.63  %goalClause: 6
% 0.21/0.63  [1]P1(a1)
% 0.21/0.63  [2]P2(a1)
% 0.21/0.63  [3]P5(x31)+P3(x31)
% 0.21/0.63  [4]~P4(x41)+~P1(x41)
% 0.21/0.63  [5]~P3(x51)+~P1(x51)
% 0.21/0.63  [6]~P5(x61)+~P2(x61)
% 0.21/0.63  %EqnAxiom
% 0.21/0.63  
% 0.21/0.63  %-------------------------------------------
% 0.21/0.64  cnf(9,plain,
% 0.21/0.64     ($false),
% 0.21/0.64     inference(scs_inference,[],[1,2,6,5,3]),
% 0.21/0.64     ['proof']).
% 0.21/0.64  % SZS output end Proof
% 0.21/0.64  % Total time :0.000000s
%------------------------------------------------------------------------------