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

View Problem - Process Solution

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

% Computer : n018.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:45:18 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYN343-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.16/0.34  % Computer : n018.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Sat Aug 26 20:10:15 EDT 2023
% 0.20/0.34  % CPUTime    : 
% 0.20/0.57  start to proof:theBenchmark
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  % File        :CSE---1.6
% 0.20/0.60  % Problem     :theBenchmark
% 0.20/0.60  % Transform   :cnf
% 0.20/0.60  % Format      :tptp:raw
% 0.20/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.60  
% 0.20/0.60  % Result      :Theorem 0.000000s
% 0.20/0.60  % Output      :CNFRefutation 0.000000s
% 0.20/0.60  %-------------------------------------------
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  % File     : SYN343-1 : TPTP v8.1.2. Released v1.2.0.
% 0.20/0.61  % Domain   : Syntactic
% 0.20/0.61  % Problem  : Church problem 46.16 (2)
% 0.20/0.61  % Version  : Especial.
% 0.20/0.61  % English  :
% 0.20/0.61  
% 0.20/0.61  % Refs     : [Chu56] Church (1956), Introduction to Mathematical Logic I
% 0.20/0.61  %          : [FL+93] Fermuller et al. (1993), Resolution Methods for the De
% 0.20/0.61  %          : [Tam94] Tammet (1994), Email to Geoff Sutcliffe.
% 0.20/0.61  % Source   : [Tam94]
% 0.20/0.61  % Names    : Ch16N2 [Tam94]
% 0.20/0.61  
% 0.20/0.61  % Status   : Unsatisfiable
% 0.20/0.61  % Rating   : 0.00 v2.0.0
% 0.20/0.61  % Syntax   : Number of clauses     :    3 (   0 unt;   1 nHn;   2 RR)
% 0.20/0.61  %            Number of literals    :    6 (   0 equ;   3 neg)
% 0.20/0.61  %            Maximal clause size   :    2 (   2 avg)
% 0.20/0.61  %            Maximal term depth    :    2 (   1 avg)
% 0.20/0.61  %            Number of predicates  :    1 (   1 usr;   0 prp; 2-2 aty)
% 0.20/0.61  %            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
% 0.20/0.61  %            Number of variables   :    5 (   5 sgn)
% 0.20/0.61  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.20/0.61  
% 0.20/0.61  % Comments : All the problems here can be decided by using a certain
% 0.20/0.61  %            completeness-preserving term ordering strategies. See [FL+93].
% 0.20/0.61  %          : The conversion from the full 1st order form in [Chu56]
% 0.20/0.61  %            to clause form was done by hand by Tanel Tammet.
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  cnf(clause1,negated_conjecture,
% 0.20/0.61      ( f(a,Y1)
% 0.20/0.61      | f(a,a) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause2,negated_conjecture,
% 0.20/0.61      ( ~ f(z(Y1,Y2),a)
% 0.20/0.61      | f(a,a) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(clause3,negated_conjecture,
% 0.20/0.61      ( ~ f(a,a)
% 0.20/0.61      | ~ f(Y1,Y2) ) ).
% 0.20/0.61  
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark
% 0.20/0.61  % SZS output start Proof
% 0.20/0.61  %ClaNum:3(EqnAxiom:0)
% 0.20/0.61  %VarNum:3(SingletonVarNum:3)
% 0.20/0.61  %MaxLitNum:2
% 0.20/0.61  %MaxfuncDepth:0
% 0.20/0.61  %SharedTerms:3
% 0.20/0.61  %goalClause: 1 2
% 0.20/0.61  [1]P1(a1,x11)+P1(a1,a1)
% 0.20/0.61  [2]~P1(x21,x22)+~P1(a1,a1)
% 0.20/0.61  %EqnAxiom
% 0.20/0.61  
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  cnf(4,plain,
% 0.20/0.61     ($false),
% 0.20/0.61     inference(scs_inference,[],[1,2]),
% 0.20/0.61     ['proof']).
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time :0.000000s
%------------------------------------------------------------------------------