TSTP Solution File: SWC041+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC041+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n019.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:47:33 EDT 2022
% Result : Theorem 51.31s 51.51s
% Output : Refutation 51.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC041+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 12 12:59:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 51.31/51.51 # Version: 1.3
% 51.31/51.51 # SZS status Theorem
% 51.31/51.51 # SZS output start CNFRefutation
% 51.31/51.51 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((nil!=V|V!=X)|U!=W)|nil=U)|(![Y]:(ssList(Y)=>((app(W,Y)!=X|(~equalelemsP(W)))|(?[Z]:(ssItem(Z)&(?[X1]:((ssList(X1)&app(cons(Z,nil),X1)=Y)&(?[X2]:(ssList(X2)&app(X2,cons(Z,nil))=W))))))))))|(nil!=X&nil=W)))))))))),input).
% 51.31/51.51 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((nil!=V|V!=X)|U!=W)|nil=U)|(![Y]:(ssList(Y)=>((app(W,Y)!=X|(~equalelemsP(W)))|(?[Z]:(ssItem(Z)&(?[X1]:((ssList(X1)&app(cons(Z,nil),X1)=Y)&(?[X2]:(ssList(X2)&app(X2,cons(Z,nil))=W))))))))))|(nil!=X&nil=W))))))))))),inference(assume_negation,status(cth),[co1])).
% 51.31/51.51 fof(c24,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((nil!=V|V!=X)|U!=W)|nil=U)|(![Y]:(ssList(Y)=>((app(W,Y)!=X|~equalelemsP(W))|(?[Z]:(ssItem(Z)&(?[X1]:((ssList(X1)&app(cons(Z,nil),X1)=Y)&(?[X2]:(ssList(X2)&app(X2,cons(Z,nil))=W))))))))))|(nil!=X&nil=W))))))))))),inference(fof_simplification,status(thm),[c23])).
% 51.31/51.51 fof(c25,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&(((((nil=V&V=X)&U=W)&nil!=U)&(?[Y]:(ssList(Y)&((app(W,Y)=X&equalelemsP(W))&(![Z]:(~ssItem(Z)|(![X1]:((~ssList(X1)|app(cons(Z,nil),X1)!=Y)|(![X2]:(~ssList(X2)|app(X2,cons(Z,nil))!=W))))))))))&(nil=X|nil!=W)))))))))),inference(fof_nnf,status(thm),[c24])).
% 51.31/51.51 fof(c26,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&(((((nil=V&V=X)&U=W)&nil!=U)&(?[Y]:(ssList(Y)&((app(W,Y)=X&equalelemsP(W))&(![Z]:(~ssItem(Z)|((![X1]:(~ssList(X1)|app(cons(Z,nil),X1)!=Y))|(![X2]:(~ssList(X2)|app(X2,cons(Z,nil))!=W)))))))))&(nil=X|nil!=W)))))))))),inference(shift_quantors,status(thm),[c25])).
% 51.31/51.51 fof(c27,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:(ssList(X5)&(((((nil=X3&X3=X5)&X2=X4)&nil!=X2)&(?[X6]:(ssList(X6)&((app(X4,X6)=X5&equalelemsP(X4))&(![X7]:(~ssItem(X7)|((![X8]:(~ssList(X8)|app(cons(X7,nil),X8)!=X6))|(![X9]:(~ssList(X9)|app(X9,cons(X7,nil))!=X4)))))))))&(nil=X5|nil!=X4)))))))))),inference(variable_rename,status(thm),[c26])).
% 51.31/51.51 fof(c29,negated_conjecture,(![X7]:(![X8]:(![X9]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((((nil=skolem0002&skolem0002=skolem0004)&skolem0001=skolem0003)&nil!=skolem0001)&(ssList(skolem0005)&((app(skolem0003,skolem0005)=skolem0004&equalelemsP(skolem0003))&(~ssItem(X7)|((~ssList(X8)|app(cons(X7,nil),X8)!=skolem0005)|(~ssList(X9)|app(X9,cons(X7,nil))!=skolem0003))))))&(nil=skolem0004|nil!=skolem0003))))))))),inference(shift_quantors,status(thm),[fof(c28,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((((nil=skolem0002&skolem0002=skolem0004)&skolem0001=skolem0003)&nil!=skolem0001)&(ssList(skolem0005)&((app(skolem0003,skolem0005)=skolem0004&equalelemsP(skolem0003))&(![X7]:(~ssItem(X7)|((![X8]:(~ssList(X8)|app(cons(X7,nil),X8)!=skolem0005))|(![X9]:(~ssList(X9)|app(X9,cons(X7,nil))!=skolem0003))))))))&(nil=skolem0004|nil!=skolem0003)))))),inference(skolemize,status(esa),[c27])).])).
% 51.31/51.51 cnf(c37,negated_conjecture,nil!=skolem0001,inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 cnf(transitivity,axiom,X259!=X258|X258!=X257|X259=X257,eq_axiom).
% 51.31/51.51 cnf(symmetry,axiom,X256!=X255|X255=X256,eq_axiom).
% 51.31/51.51 cnf(c36,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 cnf(c525,plain,skolem0003=skolem0001,inference(resolution,status(thm),[c36, symmetry])).
% 51.31/51.51 cnf(c542,plain,X412!=skolem0003|X412=skolem0001,inference(resolution,status(thm),[c525, transitivity])).
% 51.31/51.51 cnf(c32,negated_conjecture,ssList(skolem0003),inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 cnf(c38,negated_conjecture,ssList(skolem0005),inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 fof(ax83,axiom,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(nil=app(U,V)<=>(nil=V&nil=U)))))),input).
% 51.31/51.51 fof(c93,axiom,(![U]:(~ssList(U)|(![V]:(~ssList(V)|((nil!=app(U,V)|(nil=V&nil=U))&((nil!=V|nil!=U)|nil=app(U,V))))))),inference(fof_nnf,status(thm),[ax83])).
% 51.31/51.51 fof(c95,axiom,(![X34]:(![X35]:(~ssList(X34)|(~ssList(X35)|((nil!=app(X34,X35)|(nil=X35&nil=X34))&((nil!=X35|nil!=X34)|nil=app(X34,X35))))))),inference(shift_quantors,status(thm),[fof(c94,axiom,(![X34]:(~ssList(X34)|(![X35]:(~ssList(X35)|((nil!=app(X34,X35)|(nil=X35&nil=X34))&((nil!=X35|nil!=X34)|nil=app(X34,X35))))))),inference(variable_rename,status(thm),[c93])).])).
% 51.31/51.51 fof(c96,axiom,(![X34]:(![X35]:(((~ssList(X34)|(~ssList(X35)|(nil!=app(X34,X35)|nil=X35)))&(~ssList(X34)|(~ssList(X35)|(nil!=app(X34,X35)|nil=X34))))&(~ssList(X34)|(~ssList(X35)|((nil!=X35|nil!=X34)|nil=app(X34,X35))))))),inference(distribute,status(thm),[c95])).
% 51.31/51.51 cnf(c98,axiom,~ssList(X394)|~ssList(X395)|nil!=app(X394,X395)|nil=X394,inference(split_conjunct,status(thm),[c96])).
% 51.31/51.51 cnf(c39,negated_conjecture,app(skolem0003,skolem0005)=skolem0004,inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 cnf(c34,negated_conjecture,nil=skolem0002,inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 cnf(c35,negated_conjecture,skolem0002=skolem0004,inference(split_conjunct,status(thm),[c29])).
% 51.31/51.51 cnf(c523,plain,X388!=skolem0002|X388=skolem0004,inference(resolution,status(thm),[c35, transitivity])).
% 51.31/51.51 cnf(c768,plain,nil=skolem0004,inference(resolution,status(thm),[c523, c34])).
% 51.31/51.51 cnf(c786,plain,skolem0004=nil,inference(resolution,status(thm),[c768, symmetry])).
% 51.31/51.51 cnf(c804,plain,X418!=skolem0004|X418=nil,inference(resolution,status(thm),[c786, transitivity])).
% 51.31/51.51 cnf(c1138,plain,app(skolem0003,skolem0005)=nil,inference(resolution,status(thm),[c804, c39])).
% 51.31/51.51 cnf(c1327,plain,nil=app(skolem0003,skolem0005),inference(resolution,status(thm),[c1138, symmetry])).
% 51.31/51.51 cnf(c1624,plain,~ssList(skolem0003)|~ssList(skolem0005)|nil=skolem0003,inference(resolution,status(thm),[c1327, c98])).
% 51.31/51.51 cnf(c79520,plain,~ssList(skolem0003)|nil=skolem0003,inference(resolution,status(thm),[c1624, c38])).
% 51.31/51.51 cnf(c85254,plain,nil=skolem0003,inference(resolution,status(thm),[c79520, c32])).
% 51.31/51.51 cnf(c85376,plain,nil=skolem0001,inference(resolution,status(thm),[c85254, c542])).
% 51.31/51.51 cnf(c85562,plain,$false,inference(resolution,status(thm),[c85376, c37])).
% 51.31/51.51 # SZS output end CNFRefutation
% 51.31/51.51
% 51.31/51.51 # Initial clauses : 229
% 51.31/51.51 # Processed clauses : 2441
% 51.31/51.51 # Factors computed : 4
% 51.31/51.51 # Resolvents computed: 85221
% 51.31/51.51 # Tautologies deleted: 15
% 51.31/51.51 # Forward subsumed : 1352
% 51.31/51.51 # Backward subsumed : 186
% 51.31/51.51 # -------- CPU Time ---------
% 51.31/51.51 # User time : 50.983 s
% 51.31/51.51 # System time : 0.165 s
% 51.31/51.51 # Total time : 51.148 s
%------------------------------------------------------------------------------