TSTP Solution File: SWC287+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC287+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n011.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:48 EDT 2022
% Result : Theorem 17.10s 17.31s
% Output : Refutation 17.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC287+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n011.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 14:10:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 17.10/17.31 # Version: 1.3
% 17.10/17.31 # SZS status Theorem
% 17.10/17.31 # SZS output start CNFRefutation
% 17.10/17.31 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(((((~ssList(X))|V!=X)|U!=W)|strictorderedP(U))|((![Y]:((((~ssItem(Y))|cons(Y,nil)!=W)|(~memberP(X,Y)))|(?[Z]:(((ssItem(Z)&Y!=Z)&memberP(X,Z))&leq(Z,Y)))))&(nil!=X|nil!=W)))))))))),input).
% 17.10/17.31 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(((((~ssList(X))|V!=X)|U!=W)|strictorderedP(U))|((![Y]:((((~ssItem(Y))|cons(Y,nil)!=W)|(~memberP(X,Y)))|(?[Z]:(((ssItem(Z)&Y!=Z)&memberP(X,Z))&leq(Z,Y)))))&(nil!=X|nil!=W))))))))))),inference(assume_negation,status(cth),[co1])).
% 17.10/17.31 fof(c24,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:((((~ssList(X)|V!=X)|U!=W)|strictorderedP(U))|((![Y]:(((~ssItem(Y)|cons(Y,nil)!=W)|~memberP(X,Y))|(?[Z]:(((ssItem(Z)&Y!=Z)&memberP(X,Z))&leq(Z,Y)))))&(nil!=X|nil!=W))))))))))),inference(fof_simplification,status(thm),[c23])).
% 17.10/17.31 fof(c25,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:((((ssList(X)&V=X)&U=W)&~strictorderedP(U))&((?[Y]:(((ssItem(Y)&cons(Y,nil)=W)&memberP(X,Y))&(![Z]:(((~ssItem(Z)|Y=Z)|~memberP(X,Z))|~leq(Z,Y)))))|(nil=X&nil=W)))))))))),inference(fof_nnf,status(thm),[c24])).
% 17.10/17.31 fof(c26,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:((((ssList(X5)&X3=X5)&X2=X4)&~strictorderedP(X2))&((?[X6]:(((ssItem(X6)&cons(X6,nil)=X4)&memberP(X5,X6))&(![X7]:(((~ssItem(X7)|X6=X7)|~memberP(X5,X7))|~leq(X7,X6)))))|(nil=X5&nil=X4)))))))))),inference(variable_rename,status(thm),[c25])).
% 17.10/17.31 fof(c28,negated_conjecture,(![X7]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&((((ssList(skolem0004)&skolem0002=skolem0004)&skolem0001=skolem0003)&~strictorderedP(skolem0001))&((((ssItem(skolem0005)&cons(skolem0005,nil)=skolem0003)&memberP(skolem0004,skolem0005))&(((~ssItem(X7)|skolem0005=X7)|~memberP(skolem0004,X7))|~leq(X7,skolem0005)))|(nil=skolem0004&nil=skolem0003))))))),inference(shift_quantors,status(thm),[fof(c27,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&((((ssList(skolem0004)&skolem0002=skolem0004)&skolem0001=skolem0003)&~strictorderedP(skolem0001))&((((ssItem(skolem0005)&cons(skolem0005,nil)=skolem0003)&memberP(skolem0004,skolem0005))&(![X7]:(((~ssItem(X7)|skolem0005=X7)|~memberP(skolem0004,X7))|~leq(X7,skolem0005))))|(nil=skolem0004&nil=skolem0003)))))),inference(skolemize,status(esa),[c26])).])).
% 17.10/17.31 fof(c29,negated_conjecture,(![X7]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&((((ssList(skolem0004)&skolem0002=skolem0004)&skolem0001=skolem0003)&~strictorderedP(skolem0001))&(((((ssItem(skolem0005)|nil=skolem0004)&(ssItem(skolem0005)|nil=skolem0003))&((cons(skolem0005,nil)=skolem0003|nil=skolem0004)&(cons(skolem0005,nil)=skolem0003|nil=skolem0003)))&((memberP(skolem0004,skolem0005)|nil=skolem0004)&(memberP(skolem0004,skolem0005)|nil=skolem0003)))&(((((~ssItem(X7)|skolem0005=X7)|~memberP(skolem0004,X7))|~leq(X7,skolem0005))|nil=skolem0004)&((((~ssItem(X7)|skolem0005=X7)|~memberP(skolem0004,X7))|~leq(X7,skolem0005))|nil=skolem0003)))))))),inference(distribute,status(thm),[c28])).
% 17.10/17.31 cnf(c36,negated_conjecture,~strictorderedP(skolem0001),inference(split_conjunct,status(thm),[c29])).
% 17.10/17.31 cnf(symmetry,axiom,X253!=X254|X254=X253,eq_axiom).
% 17.10/17.31 cnf(c35,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,status(thm),[c29])).
% 17.10/17.31 cnf(c520,plain,skolem0003=skolem0001,inference(resolution,status(thm),[c35, symmetry])).
% 17.10/17.31 cnf(c18,plain,X335!=X334|~strictorderedP(X335)|strictorderedP(X334),eq_axiom).
% 17.10/17.31 cnf(c645,plain,~strictorderedP(skolem0003)|strictorderedP(skolem0001),inference(resolution,status(thm),[c18, c520])).
% 17.10/17.31 fof(ax69,axiom,strictorderedP(nil),input).
% 17.10/17.31 cnf(c154,axiom,strictorderedP(nil),inference(split_conjunct,status(thm),[ax69])).
% 17.10/17.31 fof(ax68,axiom,(![U]:(ssItem(U)=>strictorderedP(cons(U,nil)))),input).
% 17.10/17.31 fof(c155,axiom,(![U]:(~ssItem(U)|strictorderedP(cons(U,nil)))),inference(fof_nnf,status(thm),[ax68])).
% 17.10/17.31 fof(c156,axiom,(![X56]:(~ssItem(X56)|strictorderedP(cons(X56,nil)))),inference(variable_rename,status(thm),[c155])).
% 17.10/17.31 cnf(c157,axiom,~ssItem(X353)|strictorderedP(cons(X353,nil)),inference(split_conjunct,status(thm),[c156])).
% 17.10/17.31 cnf(c38,negated_conjecture,ssItem(skolem0005)|nil=skolem0003,inference(split_conjunct,status(thm),[c29])).
% 17.10/17.31 cnf(c687,plain,ssItem(skolem0005)|~strictorderedP(nil)|strictorderedP(skolem0003),inference(resolution,status(thm),[c38, c18])).
% 17.10/17.31 cnf(c25534,plain,ssItem(skolem0005)|strictorderedP(skolem0003),inference(resolution,status(thm),[c687, c154])).
% 17.10/17.31 cnf(c25550,plain,ssItem(skolem0005)|strictorderedP(skolem0001),inference(resolution,status(thm),[c25534, c645])).
% 17.10/17.31 cnf(c25566,plain,ssItem(skolem0005),inference(resolution,status(thm),[c25550, c36])).
% 17.10/17.31 cnf(c25577,plain,strictorderedP(cons(skolem0005,nil)),inference(resolution,status(thm),[c25566, c157])).
% 17.10/17.31 cnf(c40,negated_conjecture,cons(skolem0005,nil)=skolem0003|nil=skolem0003,inference(split_conjunct,status(thm),[c29])).
% 17.10/17.31 cnf(c751,plain,nil=skolem0003|~strictorderedP(cons(skolem0005,nil))|strictorderedP(skolem0003),inference(resolution,status(thm),[c40, c18])).
% 17.10/17.31 cnf(c29231,plain,nil=skolem0003|strictorderedP(skolem0003),inference(resolution,status(thm),[c751, c25577])).
% 17.10/17.31 cnf(c30839,plain,strictorderedP(skolem0003)|~strictorderedP(nil),inference(resolution,status(thm),[c29231, c18])).
% 17.10/17.31 cnf(c30896,plain,strictorderedP(skolem0003),inference(resolution,status(thm),[c30839, c154])).
% 17.10/17.31 cnf(c30897,plain,strictorderedP(skolem0001),inference(resolution,status(thm),[c30896, c645])).
% 17.10/17.31 cnf(c30898,plain,$false,inference(resolution,status(thm),[c30897, c36])).
% 17.10/17.31 # SZS output end CNFRefutation
% 17.10/17.31
% 17.10/17.31 # Initial clauses : 231
% 17.10/17.31 # Processed clauses : 1318
% 17.10/17.31 # Factors computed : 0
% 17.10/17.31 # Resolvents computed: 30385
% 17.10/17.31 # Tautologies deleted: 13
% 17.10/17.31 # Forward subsumed : 802
% 17.10/17.31 # Backward subsumed : 365
% 17.10/17.31 # -------- CPU Time ---------
% 17.10/17.31 # User time : 16.874 s
% 17.10/17.31 # System time : 0.089 s
% 17.10/17.31 # Total time : 16.963 s
%------------------------------------------------------------------------------