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

View Problem - Process Solution

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

% 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 : Fri Sep  1 01:43:58 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYN065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 19:25:24 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.59  start to proof:theBenchmark
% 0.20/0.63  %-------------------------------------------
% 0.20/0.63  % File        :CSE---1.6
% 0.20/0.63  % Problem     :theBenchmark
% 0.20/0.63  % Transform   :cnf
% 0.20/0.63  % Format      :tptp:raw
% 0.20/0.63  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.63  
% 0.20/0.63  % Result      :Theorem 0.000000s
% 0.20/0.63  % Output      :CNFRefutation 0.000000s
% 0.20/0.63  %-------------------------------------------
% 0.20/0.64  %--------------------------------------------------------------------------
% 0.20/0.64  % File     : SYN065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.64  % Domain   : Syntactic
% 0.20/0.64  % Problem  : Pelletier Problem 36
% 0.20/0.64  % Version  : Especial.
% 0.20/0.64  % English  :
% 0.20/0.64  
% 0.20/0.64  % Refs     : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
% 0.20/0.64  % Source   : [Pel86]
% 0.20/0.64  % Names    : Pelletier 36 [Pel86]
% 0.20/0.64  %          : p36.in [ANL]
% 0.20/0.64  
% 0.20/0.64  % Status   : Unsatisfiable
% 0.20/0.64  % Rating   : 0.00 v6.1.0, 0.07 v6.0.0, 0.11 v5.5.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.14 v3.7.0, 0.00 v2.0.0
% 0.20/0.64  % Syntax   : Number of clauses     :    7 (   3 unt;   0 nHn;   5 RR)
% 0.20/0.64  %            Number of literals    :   15 (   0 equ;   9 neg)
% 0.20/0.64  %            Maximal clause size   :    3 (   2 avg)
% 0.20/0.64  %            Maximal term depth    :    2 (   1 avg)
% 0.20/0.64  %            Number of predicates  :    3 (   3 usr;   0 prp; 2-2 aty)
% 0.20/0.64  %            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
% 0.20/0.64  %            Number of variables   :   15 (   1 sgn)
% 0.20/0.64  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.64  
% 0.20/0.64  % Comments :
% 0.20/0.64  %--------------------------------------------------------------------------
% 0.20/0.64  cnf(clause_1,axiom,
% 0.20/0.64      big_f(X,f(X)) ).
% 0.20/0.64  
% 0.20/0.64  cnf(clause_2,axiom,
% 0.20/0.64      big_g(X,g(X)) ).
% 0.20/0.64  
% 0.20/0.64  cnf(clause_3,axiom,
% 0.20/0.64      ( ~ big_f(X,Y)
% 0.20/0.64      | ~ big_f(Y,Z)
% 0.20/0.64      | big_h(X,Z) ) ).
% 0.20/0.64  
% 0.20/0.64  cnf(clause_4,axiom,
% 0.20/0.64      ( ~ big_f(X,Y)
% 0.20/0.64      | ~ big_g(Y,Z)
% 0.20/0.64      | big_h(X,Z) ) ).
% 0.20/0.64  
% 0.20/0.64  cnf(clause_5,axiom,
% 0.20/0.64      ( ~ big_g(X,Y)
% 0.20/0.64      | ~ big_f(Y,Z)
% 0.20/0.64      | big_h(X,Z) ) ).
% 0.20/0.64  
% 0.20/0.64  cnf(clause_6,axiom,
% 0.20/0.64      ( ~ big_g(X,Y)
% 0.20/0.64      | ~ big_g(Y,Z)
% 0.20/0.64      | big_h(X,Z) ) ).
% 0.20/0.64  
% 0.20/0.64  cnf(clause_7,negated_conjecture,
% 0.20/0.64      ~ big_h(a,X) ).
% 0.20/0.64  
% 0.20/0.64  %--------------------------------------------------------------------------
% 0.20/0.64  %-------------------------------------------
% 0.20/0.64  % Proof found
% 0.20/0.64  % SZS status Theorem for theBenchmark
% 0.20/0.64  % SZS output start Proof
% 0.20/0.64  %ClaNum:7(EqnAxiom:0)
% 0.20/0.64  %VarNum:29(SingletonVarNum:15)
% 0.20/0.64  %MaxLitNum:3
% 0.20/0.64  %MaxfuncDepth:1
% 0.20/0.64  %SharedTerms:1
% 0.20/0.64  %goalClause: 3
% 0.20/0.64  %singleGoalClaCount:1
% 0.20/0.64  [3]~P3(a2,x31)
% 0.20/0.64  [1]P1(x11,f1(x11))
% 0.20/0.64  [2]P2(x21,f3(x21))
% 0.20/0.64  [4]~P1(x41,x43)+P3(x41,x42)+~P1(x43,x42)
% 0.20/0.64  [5]~P2(x51,x53)+P3(x51,x52)+~P1(x53,x52)
% 0.20/0.64  [6]~P2(x63,x62)+P3(x61,x62)+~P1(x61,x63)
% 0.20/0.64  [7]~P2(x71,x73)+P3(x71,x72)+~P2(x73,x72)
% 0.20/0.64  %EqnAxiom
% 0.20/0.64  
% 0.20/0.64  %-------------------------------------------
% 0.20/0.64  cnf(8,plain,
% 0.20/0.64     ($false),
% 0.20/0.64     inference(scs_inference,[],[2,3,1,5]),
% 0.20/0.64     ['proof']).
% 0.20/0.64  % SZS output end Proof
% 0.20/0.64  % Total time :0.000000s
%------------------------------------------------------------------------------