TSTP Solution File: SWC135+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC135+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n015.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 : Tue Jul 19 21:48:01 EDT 2022
% Result : Theorem 194.28s 194.54s
% Output : Refutation 194.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC135+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n015.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 : Sun Jun 12 10:45:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 194.28/194.54 # Version: 1.3
% 194.28/194.54 # SZS status Theorem
% 194.28/194.54 # SZS output start CNFRefutation
% 194.28/194.54 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((V!=X|U!=W)|neq(X,nil))|cyclefreeP(V)))))))))),input).
% 194.28/194.54 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((V!=X|U!=W)|neq(X,nil))|cyclefreeP(V))))))))))),inference(assume_negation,status(cth),[co1])).
% 194.28/194.54 fof(c24,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&(((V=X&U=W)&~neq(X,nil))&~cyclefreeP(V)))))))))),inference(fof_nnf,status(thm),[c23])).
% 194.28/194.54 fof(c25,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:(ssList(X5)&(((X3=X5&X2=X4)&~neq(X5,nil))&~cyclefreeP(X3)))))))))),inference(variable_rename,status(thm),[c24])).
% 194.28/194.54 fof(c26,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((skolem0002=skolem0004&skolem0001=skolem0003)&~neq(skolem0004,nil))&~cyclefreeP(skolem0002)))))),inference(skolemize,status(esa),[c25])).
% 194.28/194.54 cnf(c34,negated_conjecture,~cyclefreeP(skolem0002),inference(split_conjunct,status(thm),[c26])).
% 194.28/194.54 cnf(symmetry,axiom,X252!=X251|X251=X252,eq_axiom).
% 194.28/194.54 cnf(c31,negated_conjecture,skolem0002=skolem0004,inference(split_conjunct,status(thm),[c26])).
% 194.28/194.54 cnf(c509,plain,skolem0004=skolem0002,inference(resolution,status(thm),[c31, symmetry])).
% 194.28/194.54 cnf(c12,plain,X311!=X312|~cyclefreeP(X311)|cyclefreeP(X312),eq_axiom).
% 194.28/194.54 cnf(c614,plain,~cyclefreeP(skolem0004)|cyclefreeP(skolem0002),inference(resolution,status(thm),[c12, c509])).
% 194.28/194.54 fof(ax60,axiom,cyclefreeP(nil),input).
% 194.28/194.54 cnf(c169,axiom,cyclefreeP(nil),inference(split_conjunct,status(thm),[ax60])).
% 194.28/194.54 cnf(c33,negated_conjecture,~neq(skolem0004,nil),inference(split_conjunct,status(thm),[c26])).
% 194.28/194.54 cnf(c30,negated_conjecture,ssList(skolem0004),inference(split_conjunct,status(thm),[c26])).
% 194.28/194.54 fof(ax17,axiom,ssList(nil),input).
% 194.28/194.54 cnf(c347,axiom,ssList(nil),inference(split_conjunct,status(thm),[ax17])).
% 194.28/194.54 fof(ax15,axiom,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(neq(U,V)<=>U!=V))))),input).
% 194.28/194.54 fof(c352,axiom,(![U]:(~ssList(U)|(![V]:(~ssList(V)|((~neq(U,V)|U!=V)&(U=V|neq(U,V))))))),inference(fof_nnf,status(thm),[ax15])).
% 194.28/194.54 fof(c354,axiom,(![X146]:(![X147]:(~ssList(X146)|(~ssList(X147)|((~neq(X146,X147)|X146!=X147)&(X146=X147|neq(X146,X147))))))),inference(shift_quantors,status(thm),[fof(c353,axiom,(![X146]:(~ssList(X146)|(![X147]:(~ssList(X147)|((~neq(X146,X147)|X146!=X147)&(X146=X147|neq(X146,X147))))))),inference(variable_rename,status(thm),[c352])).])).
% 194.28/194.54 fof(c355,axiom,(![X146]:(![X147]:((~ssList(X146)|(~ssList(X147)|(~neq(X146,X147)|X146!=X147)))&(~ssList(X146)|(~ssList(X147)|(X146=X147|neq(X146,X147))))))),inference(distribute,status(thm),[c354])).
% 194.28/194.54 cnf(c357,axiom,~ssList(X567)|~ssList(X568)|X567=X568|neq(X567,X568),inference(split_conjunct,status(thm),[c355])).
% 194.28/194.54 cnf(c6846,plain,~ssList(X1184)|X1184=nil|neq(X1184,nil),inference(resolution,status(thm),[c357, c347])).
% 194.28/194.54 cnf(c222688,plain,skolem0004=nil|neq(skolem0004,nil),inference(resolution,status(thm),[c6846, c30])).
% 194.28/194.54 cnf(c223365,plain,skolem0004=nil,inference(resolution,status(thm),[c222688, c33])).
% 194.28/194.54 cnf(c224353,plain,nil=skolem0004,inference(resolution,status(thm),[c223365, symmetry])).
% 194.28/194.54 cnf(c224624,plain,~cyclefreeP(nil)|cyclefreeP(skolem0004),inference(resolution,status(thm),[c224353, c12])).
% 194.28/194.54 cnf(c226695,plain,cyclefreeP(skolem0004),inference(resolution,status(thm),[c224624, c169])).
% 194.28/194.54 cnf(c226698,plain,cyclefreeP(skolem0002),inference(resolution,status(thm),[c226695, c614])).
% 194.28/194.54 cnf(c226701,plain,$false,inference(resolution,status(thm),[c226698, c34])).
% 194.28/194.54 # SZS output end CNFRefutation
% 194.28/194.54
% 194.28/194.54 # Initial clauses : 224
% 194.28/194.54 # Processed clauses : 3843
% 194.28/194.54 # Factors computed : 1
% 194.28/194.54 # Resolvents computed: 226197
% 194.28/194.54 # Tautologies deleted: 15
% 194.28/194.54 # Forward subsumed : 1795
% 194.28/194.54 # Backward subsumed : 564
% 194.28/194.54 # -------- CPU Time ---------
% 194.28/194.54 # User time : 193.714 s
% 194.28/194.54 # System time : 0.429 s
% 194.28/194.54 # Total time : 194.143 s
%------------------------------------------------------------------------------