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

View Problem - Process Solution

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

% Computer : n006.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:31:54 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.07/0.12  % Problem  : SYN918+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 19:16:50 EDT 2022
% 0.13/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,(((![X]:(((f(X)&g(X))=>h(X))=>(?[Y]:(f(Y)&(~g(Y))))))&((![W]:(f(W)=>g(W)))|(![Z]:(f(Z)=>h(Z)))))=>((![R]:((f(R)&h(R))=>g(R)))=>(?[V]:((f(V)&g(V))&(~h(V)))))),input).
% 0.21/0.52  fof(c0,negated_conjecture,(~(((![X]:(((f(X)&g(X))=>h(X))=>(?[Y]:(f(Y)&(~g(Y))))))&((![W]:(f(W)=>g(W)))|(![Z]:(f(Z)=>h(Z)))))=>((![R]:((f(R)&h(R))=>g(R)))=>(?[V]:((f(V)&g(V))&(~h(V))))))),inference(assume_negation,status(cth),[prove_this])).
% 0.21/0.52  fof(c1,negated_conjecture,(~(((![X]:(((f(X)&g(X))=>h(X))=>(?[Y]:(f(Y)&~g(Y)))))&((![W]:(f(W)=>g(W)))|(![Z]:(f(Z)=>h(Z)))))=>((![R]:((f(R)&h(R))=>g(R)))=>(?[V]:((f(V)&g(V))&~h(V)))))),inference(fof_simplification,status(thm),[c0])).
% 0.21/0.52  fof(c2,negated_conjecture,(((![X]:(((f(X)&g(X))&~h(X))|(?[Y]:(f(Y)&~g(Y)))))&((![W]:(~f(W)|g(W)))|(![Z]:(~f(Z)|h(Z)))))&((![R]:((~f(R)|~h(R))|g(R)))&(![V]:((~f(V)|~g(V))|h(V))))),inference(fof_nnf,status(thm),[c1])).
% 0.21/0.52  fof(c3,negated_conjecture,((((((![X]:f(X))&(![X]:g(X)))&(![X]:~h(X)))|(?[Y]:(f(Y)&~g(Y))))&((![W]:(~f(W)|g(W)))|(![Z]:(~f(Z)|h(Z)))))&((![R]:((~f(R)|~h(R))|g(R)))&(![V]:((~f(V)|~g(V))|h(V))))),inference(shift_quantors,status(thm),[c2])).
% 0.21/0.52  fof(c4,negated_conjecture,((((((![X2]:f(X2))&(![X3]:g(X3)))&(![X4]:~h(X4)))|(?[X5]:(f(X5)&~g(X5))))&((![X6]:(~f(X6)|g(X6)))|(![X7]:(~f(X7)|h(X7)))))&((![X8]:((~f(X8)|~h(X8))|g(X8)))&(![X9]:((~f(X9)|~g(X9))|h(X9))))),inference(variable_rename,status(thm),[c3])).
% 0.21/0.52  fof(c6,negated_conjecture,(![X2]:(![X3]:(![X4]:(![X6]:(![X7]:(![X8]:(![X9]:(((((f(X2)&g(X3))&~h(X4))|(f(skolem0001)&~g(skolem0001)))&((~f(X6)|g(X6))|(~f(X7)|h(X7))))&(((~f(X8)|~h(X8))|g(X8))&((~f(X9)|~g(X9))|h(X9))))))))))),inference(shift_quantors,status(thm),[fof(c5,negated_conjecture,((((((![X2]:f(X2))&(![X3]:g(X3)))&(![X4]:~h(X4)))|(f(skolem0001)&~g(skolem0001)))&((![X6]:(~f(X6)|g(X6)))|(![X7]:(~f(X7)|h(X7)))))&((![X8]:((~f(X8)|~h(X8))|g(X8)))&(![X9]:((~f(X9)|~g(X9))|h(X9))))),inference(skolemize,status(esa),[c4])).])).
% 0.21/0.52  fof(c7,negated_conjecture,(![X2]:(![X3]:(![X4]:(![X6]:(![X7]:(![X8]:(![X9]:((((((f(X2)|f(skolem0001))&(f(X2)|~g(skolem0001)))&((g(X3)|f(skolem0001))&(g(X3)|~g(skolem0001))))&((~h(X4)|f(skolem0001))&(~h(X4)|~g(skolem0001))))&((~f(X6)|g(X6))|(~f(X7)|h(X7))))&(((~f(X8)|~h(X8))|g(X8))&((~f(X9)|~g(X9))|h(X9))))))))))),inference(distribute,status(thm),[c6])).
% 0.21/0.52  cnf(c8,negated_conjecture,f(X10)|f(skolem0001),inference(split_conjunct,status(thm),[c7])).
% 0.21/0.52  cnf(c17,plain,f(skolem0001),inference(factor,status(thm),[c8])).
% 0.21/0.52  cnf(c16,negated_conjecture,~f(X17)|~g(X17)|h(X17),inference(split_conjunct,status(thm),[c7])).
% 0.21/0.52  cnf(c14,negated_conjecture,~f(X19)|g(X19)|~f(X18)|h(X18),inference(split_conjunct,status(thm),[c7])).
% 0.21/0.52  cnf(c18,plain,~f(X20)|g(X20)|h(skolem0001),inference(resolution,status(thm),[c14, c17])).
% 0.21/0.52  cnf(c19,plain,g(skolem0001)|h(skolem0001),inference(resolution,status(thm),[c18, c17])).
% 0.21/0.52  cnf(c23,plain,h(skolem0001)|~f(skolem0001),inference(resolution,status(thm),[c19, c16])).
% 0.21/0.52  cnf(c36,plain,h(skolem0001),inference(resolution,status(thm),[c23, c17])).
% 0.21/0.52  cnf(c13,negated_conjecture,~h(X15)|~g(skolem0001),inference(split_conjunct,status(thm),[c7])).
% 0.21/0.52  cnf(c15,negated_conjecture,~f(X16)|~h(X16)|g(X16),inference(split_conjunct,status(thm),[c7])).
% 0.21/0.52  cnf(c24,plain,g(skolem0001)|~f(skolem0001),inference(resolution,status(thm),[c19, c15])).
% 0.21/0.52  cnf(c39,plain,g(skolem0001),inference(resolution,status(thm),[c24, c17])).
% 0.21/0.52  cnf(c40,plain,~h(X29),inference(resolution,status(thm),[c39, c13])).
% 0.21/0.52  cnf(c44,plain,$false,inference(resolution,status(thm),[c40, c36])).
% 0.21/0.52  # SZS output end CNFRefutation
% 0.21/0.52  
% 0.21/0.52  # Initial clauses    : 9
% 0.21/0.52  # Processed clauses  : 18
% 0.21/0.52  # Factors computed   : 1
% 0.21/0.52  # Resolvents computed: 27
% 0.21/0.52  # Tautologies deleted: 0
% 0.21/0.52  # Forward subsumed   : 8
% 0.21/0.52  # Backward subsumed  : 10
% 0.21/0.52  # -------- CPU Time ---------
% 0.21/0.52  # User time          : 0.163 s
% 0.21/0.52  # System time        : 0.015 s
% 0.21/0.52  # Total time         : 0.178 s
%------------------------------------------------------------------------------