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

View Problem - Process Solution

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

% Computer : n021.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:32:08 EDT 2022

% Result   : Theorem 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN954+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34  % Computer : n021.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 : Mon Jul 11 17:14:08 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.52  # Version:  1.3
% 0.21/0.52  # SZS status Theorem
% 0.21/0.52  # SZS output start CNFRefutation
% 0.21/0.52  fof(prove_this,conjecture,(![A]:(![B]:((![Z]:(q(Z)=>p(Z)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B))))))),input).
% 0.21/0.52  fof(c0,negated_conjecture,(~(![A]:(![B]:((![Z]:(q(Z)=>p(Z)))=>(?[X]:((p(X)=>p(A))&(q(X)=>p(B)))))))),inference(assume_negation,status(cth),[prove_this])).
% 0.21/0.52  fof(c1,negated_conjecture,(?[A]:(?[B]:((![Z]:(~q(Z)|p(Z)))&(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(fof_nnf,status(thm),[c0])).
% 0.21/0.52  fof(c2,negated_conjecture,((![Z]:(~q(Z)|p(Z)))&(?[A]:(?[B]:(![X]:((p(X)&~p(A))|(q(X)&~p(B))))))),inference(shift_quantors,status(thm),[c1])).
% 0.21/0.52  fof(c3,negated_conjecture,((![X2]:(~q(X2)|p(X2)))&(?[X3]:(?[X4]:(![X5]:((p(X5)&~p(X3))|(q(X5)&~p(X4))))))),inference(variable_rename,status(thm),[c2])).
% 0.21/0.52  fof(c5,negated_conjecture,(![X2]:(![X5]:((~q(X2)|p(X2))&((p(X5)&~p(skolem0001))|(q(X5)&~p(skolem0002)))))),inference(shift_quantors,status(thm),[fof(c4,negated_conjecture,((![X2]:(~q(X2)|p(X2)))&(![X5]:((p(X5)&~p(skolem0001))|(q(X5)&~p(skolem0002))))),inference(skolemize,status(esa),[c3])).])).
% 0.21/0.52  fof(c6,negated_conjecture,(![X2]:(![X5]:((~q(X2)|p(X2))&(((p(X5)|q(X5))&(p(X5)|~p(skolem0002)))&((~p(skolem0001)|q(X5))&(~p(skolem0001)|~p(skolem0002))))))),inference(distribute,status(thm),[c5])).
% 0.21/0.52  cnf(c7,negated_conjecture,~q(X6)|p(X6),inference(split_conjunct,status(thm),[c6])).
% 0.21/0.52  cnf(c8,negated_conjecture,p(X7)|q(X7),inference(split_conjunct,status(thm),[c6])).
% 0.21/0.52  cnf(c12,plain,p(X8),inference(resolution,status(thm),[c8, c7])).
% 0.21/0.52  cnf(c11,negated_conjecture,~p(skolem0001)|~p(skolem0002),inference(split_conjunct,status(thm),[c6])).
% 0.21/0.52  cnf(c14,plain,~p(skolem0001),inference(resolution,status(thm),[c11, c12])).
% 0.21/0.52  cnf(c15,plain,$false,inference(resolution,status(thm),[c14, c12])).
% 0.21/0.52  # SZS output end CNFRefutation
% 0.21/0.52  
% 0.21/0.52  # Initial clauses    : 5
% 0.21/0.52  # Processed clauses  : 7
% 0.21/0.52  # Factors computed   : 0
% 0.21/0.52  # Resolvents computed: 4
% 0.21/0.52  # Tautologies deleted: 0
% 0.21/0.52  # Forward subsumed   : 1
% 0.21/0.52  # Backward subsumed  : 4
% 0.21/0.52  # -------- CPU Time ---------
% 0.21/0.52  # User time          : 0.154 s
% 0.21/0.52  # System time        : 0.015 s
% 0.21/0.52  # Total time         : 0.169 s
%------------------------------------------------------------------------------