TSTP Solution File: SYN398+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SYN398+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 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 : 600s
% DateTime : Thu Jul 21 11:27:54 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN398+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 : n018.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 20:18:14 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.51 # Version: 1.3
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% 0.20/0.51 fof(kalish215,conjecture,((![X]:(p&f(X)))<=>(p&(![Y]:f(Y)))),input).
% 0.20/0.51 fof(c0,negated_conjecture,(~((![X]:(p&f(X)))<=>(p&(![Y]:f(Y))))),inference(assume_negation,status(cth),[kalish215])).
% 0.20/0.51 fof(c1,negated_conjecture,(((?[X]:(~p|~f(X)))|(~p|(?[Y]:~f(Y))))&((![X]:(p&f(X)))|(p&(![Y]:f(Y))))),inference(fof_nnf,status(thm),[c0])).
% 0.20/0.51 fof(c2,negated_conjecture,(((~p|(?[X]:~f(X)))|(~p|(?[Y]:~f(Y))))&((p&(![X]:f(X)))|(p&(![Y]:f(Y))))),inference(shift_quantors,status(thm),[c1])).
% 0.20/0.51 fof(c3,negated_conjecture,(((~p|(?[X2]:~f(X2)))|(~p|(?[X3]:~f(X3))))&((p&(![X4]:f(X4)))|(p&(![X5]:f(X5))))),inference(variable_rename,status(thm),[c2])).
% 0.20/0.51 fof(c5,negated_conjecture,(![X4]:(![X5]:(((~p|~f(skolem0001))|(~p|~f(skolem0002)))&((p&f(X4))|(p&f(X5)))))),inference(shift_quantors,status(thm),[fof(c4,negated_conjecture,(((~p|~f(skolem0001))|(~p|~f(skolem0002)))&((p&(![X4]:f(X4)))|(p&(![X5]:f(X5))))),inference(skolemize,status(esa),[c3])).])).
% 0.20/0.51 fof(c6,negated_conjecture,(![X4]:(![X5]:(((~p|~f(skolem0001))|(~p|~f(skolem0002)))&(((p|p)&(p|f(X5)))&((f(X4)|p)&(f(X4)|f(X5))))))),inference(distribute,status(thm),[c5])).
% 0.20/0.51 cnf(c8,negated_conjecture,p|p,inference(split_conjunct,status(thm),[c6])).
% 0.20/0.51 cnf(c12,plain,p,inference(factor,status(thm),[c8])).
% 0.20/0.51 cnf(c11,negated_conjecture,f(X9)|f(X8),inference(split_conjunct,status(thm),[c6])).
% 0.20/0.51 cnf(c13,plain,f(X10),inference(factor,status(thm),[c11])).
% 0.20/0.51 cnf(c7,negated_conjecture,~p|~f(skolem0001)|~p|~f(skolem0002),inference(split_conjunct,status(thm),[c6])).
% 0.20/0.51 cnf(c16,plain,~p|~f(skolem0001),inference(resolution,status(thm),[c13, c7])).
% 0.20/0.51 cnf(c17,plain,~p,inference(resolution,status(thm),[c16, c13])).
% 0.20/0.51 cnf(c18,plain,$false,inference(resolution,status(thm),[c17, c12])).
% 0.20/0.51 # SZS output end CNFRefutation
% 0.20/0.51
% 0.20/0.51 # Initial clauses : 5
% 0.20/0.51 # Processed clauses : 7
% 0.20/0.51 # Factors computed : 2
% 0.20/0.51 # Resolvents computed: 5
% 0.20/0.51 # Tautologies deleted: 0
% 0.20/0.51 # Forward subsumed : 2
% 0.20/0.51 # Backward subsumed : 4
% 0.20/0.51 # -------- CPU Time ---------
% 0.20/0.51 # User time : 0.157 s
% 0.20/0.51 # System time : 0.012 s
% 0.20/0.51 # Total time : 0.169 s
%------------------------------------------------------------------------------