TSTP Solution File: SYN413+1 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SYN413+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n004.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  : 600s
% DateTime : Thu Jul 21 11:28:00 EDT 2022

% Result   : Theorem 0.20s 0.45s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN413+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Tue Jul 12 00:01:07 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.45  # Version:  1.3
% 0.20/0.45  # SZS status Theorem
% 0.20/0.45  # SZS output start CNFRefutation
% 0.20/0.45  fof(kalish256,conjecture,((![Z]:(?[Y]:(![X]:(f(X,Y)<=>(f(X,Z)&(~f(X,X)))))))=>(~(?[V]:(![U]:f(U,V))))),input).
% 0.20/0.45  fof(c0,negated_conjecture,(~((![Z]:(?[Y]:(![X]:(f(X,Y)<=>(f(X,Z)&(~f(X,X)))))))=>(~(?[V]:(![U]:f(U,V)))))),inference(assume_negation,status(cth),[kalish256])).
% 0.20/0.45  fof(c1,negated_conjecture,(~((![Z]:(?[Y]:(![X]:(f(X,Y)<=>(f(X,Z)&~f(X,X))))))=>(~(?[V]:(![U]:f(U,V)))))),inference(fof_simplification,status(thm),[c0])).
% 0.20/0.45  fof(c2,negated_conjecture,((![Z]:(?[Y]:(![X]:((~f(X,Y)|(f(X,Z)&~f(X,X)))&((~f(X,Z)|f(X,X))|f(X,Y))))))&(?[V]:(![U]:f(U,V)))),inference(fof_nnf,status(thm),[c1])).
% 0.20/0.45  fof(c3,negated_conjecture,((![Z]:(?[Y]:((![X]:(~f(X,Y)|(f(X,Z)&~f(X,X))))&(![X]:((~f(X,Z)|f(X,X))|f(X,Y))))))&(?[V]:(![U]:f(U,V)))),inference(shift_quantors,status(thm),[c2])).
% 0.20/0.45  fof(c4,negated_conjecture,((![X2]:(?[X3]:((![X4]:(~f(X4,X3)|(f(X4,X2)&~f(X4,X4))))&(![X5]:((~f(X5,X2)|f(X5,X5))|f(X5,X3))))))&(?[X6]:(![X7]:f(X7,X6)))),inference(variable_rename,status(thm),[c3])).
% 0.20/0.45  fof(c6,negated_conjecture,(![X2]:(![X4]:(![X5]:(![X7]:(((~f(X4,skolem0001(X2))|(f(X4,X2)&~f(X4,X4)))&((~f(X5,X2)|f(X5,X5))|f(X5,skolem0001(X2))))&f(X7,skolem0002)))))),inference(shift_quantors,status(thm),[fof(c5,negated_conjecture,((![X2]:((![X4]:(~f(X4,skolem0001(X2))|(f(X4,X2)&~f(X4,X4))))&(![X5]:((~f(X5,X2)|f(X5,X5))|f(X5,skolem0001(X2))))))&(![X7]:f(X7,skolem0002))),inference(skolemize,status(esa),[c4])).])).
% 0.20/0.45  fof(c7,negated_conjecture,(![X2]:(![X4]:(![X5]:(![X7]:((((~f(X4,skolem0001(X2))|f(X4,X2))&(~f(X4,skolem0001(X2))|~f(X4,X4)))&((~f(X5,X2)|f(X5,X5))|f(X5,skolem0001(X2))))&f(X7,skolem0002)))))),inference(distribute,status(thm),[c6])).
% 0.20/0.45  cnf(c9,negated_conjecture,~f(X11,skolem0001(X12))|~f(X11,X11),inference(split_conjunct,status(thm),[c7])).
% 0.20/0.45  cnf(c12,plain,~f(skolem0001(X13),skolem0001(X13)),inference(factor,status(thm),[c9])).
% 0.20/0.45  cnf(c11,negated_conjecture,f(X8,skolem0002),inference(split_conjunct,status(thm),[c7])).
% 0.20/0.45  cnf(c10,negated_conjecture,~f(X14,X15)|f(X14,X14)|f(X14,skolem0001(X15)),inference(split_conjunct,status(thm),[c7])).
% 0.20/0.45  cnf(c13,plain,f(X16,X16)|f(X16,skolem0001(skolem0002)),inference(resolution,status(thm),[c10, c11])).
% 0.20/0.45  cnf(c18,plain,f(skolem0001(X18),skolem0001(skolem0002)),inference(resolution,status(thm),[c13, c12])).
% 0.20/0.45  cnf(c26,plain,$false,inference(resolution,status(thm),[c18, c12])).
% 0.20/0.45  # SZS output end CNFRefutation
% 0.20/0.45  
% 0.20/0.45  # Initial clauses    : 4
% 0.20/0.45  # Processed clauses  : 7
% 0.20/0.45  # Factors computed   : 2
% 0.20/0.45  # Resolvents computed: 13
% 0.20/0.45  # Tautologies deleted: 1
% 0.20/0.45  # Forward subsumed   : 0
% 0.20/0.45  # Backward subsumed  : 0
% 0.20/0.45  # -------- CPU Time ---------
% 0.20/0.45  # User time          : 0.090 s
% 0.20/0.45  # System time        : 0.015 s
% 0.20/0.45  # Total time         : 0.105 s
%------------------------------------------------------------------------------