TSTP Solution File: SWC179+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC179+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n013.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:16 EDT 2022
% Result : Theorem 26.55s 26.75s
% Output : Refutation 26.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC179+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n013.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 09:06:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 26.55/26.75 # Version: 1.3
% 26.55/26.75 # SZS status Theorem
% 26.55/26.75 # SZS output start CNFRefutation
% 26.55/26.75 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((V!=X|U!=W)|duplicatefreeP(U))|((![Y]:(ssItem(Y)=>(![Z]:(ssList(Z)=>(![X1]:(ssList(X1)=>(((cons(Y,nil)!=W|app(app(Z,W),X1)!=X)|(?[X2]:((ssItem(X2)&memberP(Z,X2))<(Y,X2))))|(?[X3]:((ssItem(X3)&memberP(X1,X3))<(X3,Y))))))))))&(nil!=X|nil!=W))))))))))),input).
% 26.55/26.75 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((V!=X|U!=W)|duplicatefreeP(U))|((![Y]:(ssItem(Y)=>(![Z]:(ssList(Z)=>(![X1]:(ssList(X1)=>(((cons(Y,nil)!=W|app(app(Z,W),X1)!=X)|(?[X2]:((ssItem(X2)&memberP(Z,X2))<(Y,X2))))|(?[X3]:((ssItem(X3)&memberP(X1,X3))<(X3,Y))))))))))&(nil!=X|nil!=W)))))))))))),inference(assume_negation,status(cth),[co1])).
% 26.55/26.75 fof(c24,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&(((V=X&U=W)&~duplicatefreeP(U))&((?[Y]:(ssItem(Y)&(?[Z]:(ssList(Z)&(?[X1]:(ssList(X1)&(((cons(Y,nil)=W&app(app(Z,W),X1)=X)&(![X2]:((~ssItem(X2)|~memberP(Z,X2))|~lt(Y,X2))))&(![X3]:((~ssItem(X3)|~memberP(X1,X3))|~lt(X3,Y))))))))))|(nil=X&nil=W))))))))))),inference(fof_nnf,status(thm),[c23])).
% 26.55/26.75 fof(c25,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:(ssList(X5)&(((X3=X5&X2=X4)&~duplicatefreeP(X2))&((?[X6]:(ssItem(X6)&(?[X7]:(ssList(X7)&(?[X8]:(ssList(X8)&(((cons(X6,nil)=X4&app(app(X7,X4),X8)=X5)&(![X9]:((~ssItem(X9)|~memberP(X7,X9))|~lt(X6,X9))))&(![X10]:((~ssItem(X10)|~memberP(X8,X10))|~lt(X10,X6))))))))))|(nil=X5&nil=X4))))))))))),inference(variable_rename,status(thm),[c24])).
% 26.55/26.75 fof(c27,negated_conjecture,(![X9]:(![X10]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((skolem0002=skolem0004&skolem0001=skolem0003)&~duplicatefreeP(skolem0001))&((ssItem(skolem0005)&(ssList(skolem0006)&(ssList(skolem0007)&(((cons(skolem0005,nil)=skolem0003&app(app(skolem0006,skolem0003),skolem0007)=skolem0004)&((~ssItem(X9)|~memberP(skolem0006,X9))|~lt(skolem0005,X9)))&((~ssItem(X10)|~memberP(skolem0007,X10))|~lt(X10,skolem0005))))))|(nil=skolem0004&nil=skolem0003))))))))),inference(shift_quantors,status(thm),[fof(c26,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((skolem0002=skolem0004&skolem0001=skolem0003)&~duplicatefreeP(skolem0001))&((ssItem(skolem0005)&(ssList(skolem0006)&(ssList(skolem0007)&(((cons(skolem0005,nil)=skolem0003&app(app(skolem0006,skolem0003),skolem0007)=skolem0004)&(![X9]:((~ssItem(X9)|~memberP(skolem0006,X9))|~lt(skolem0005,X9))))&(![X10]:((~ssItem(X10)|~memberP(skolem0007,X10))|~lt(X10,skolem0005)))))))|(nil=skolem0004&nil=skolem0003))))))),inference(skolemize,status(esa),[c25])).])).
% 26.55/26.75 fof(c28,negated_conjecture,(![X9]:(![X10]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((skolem0002=skolem0004&skolem0001=skolem0003)&~duplicatefreeP(skolem0001))&(((ssItem(skolem0005)|nil=skolem0004)&(ssItem(skolem0005)|nil=skolem0003))&(((ssList(skolem0006)|nil=skolem0004)&(ssList(skolem0006)|nil=skolem0003))&(((ssList(skolem0007)|nil=skolem0004)&(ssList(skolem0007)|nil=skolem0003))&(((((cons(skolem0005,nil)=skolem0003|nil=skolem0004)&(cons(skolem0005,nil)=skolem0003|nil=skolem0003))&((app(app(skolem0006,skolem0003),skolem0007)=skolem0004|nil=skolem0004)&(app(app(skolem0006,skolem0003),skolem0007)=skolem0004|nil=skolem0003)))&((((~ssItem(X9)|~memberP(skolem0006,X9))|~lt(skolem0005,X9))|nil=skolem0004)&(((~ssItem(X9)|~memberP(skolem0006,X9))|~lt(skolem0005,X9))|nil=skolem0003)))&((((~ssItem(X10)|~memberP(skolem0007,X10))|~lt(X10,skolem0005))|nil=skolem0004)&(((~ssItem(X10)|~memberP(skolem0007,X10))|~lt(X10,skolem0005))|nil=skolem0003))))))))))))),inference(distribute,status(thm),[c27])).
% 26.55/26.75 cnf(c35,negated_conjecture,~duplicatefreeP(skolem0001),inference(split_conjunct,status(thm),[c28])).
% 26.55/26.75 cnf(symmetry,axiom,X257!=X256|X256=X257,eq_axiom).
% 26.55/26.75 cnf(c34,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,status(thm),[c28])).
% 26.55/26.75 cnf(c525,plain,skolem0003=skolem0001,inference(resolution,status(thm),[c34, symmetry])).
% 26.55/26.75 cnf(c19,plain,X340!=X341|~duplicatefreeP(X340)|duplicatefreeP(X341),eq_axiom).
% 26.55/26.75 cnf(c655,plain,~duplicatefreeP(skolem0003)|duplicatefreeP(skolem0001),inference(resolution,status(thm),[c19, c525])).
% 26.55/26.75 fof(ax72,axiom,duplicatefreeP(nil),input).
% 26.55/26.75 cnf(c146,axiom,duplicatefreeP(nil),inference(split_conjunct,status(thm),[ax72])).
% 26.55/26.75 fof(ax71,axiom,(![U]:(ssItem(U)=>duplicatefreeP(cons(U,nil)))),input).
% 26.55/26.75 fof(c147,axiom,(![U]:(~ssItem(U)|duplicatefreeP(cons(U,nil)))),inference(fof_nnf,status(thm),[ax71])).
% 26.55/26.75 fof(c148,axiom,(![X56]:(~ssItem(X56)|duplicatefreeP(cons(X56,nil)))),inference(variable_rename,status(thm),[c147])).
% 26.55/26.75 cnf(c149,axiom,~ssItem(X355)|duplicatefreeP(cons(X355,nil)),inference(split_conjunct,status(thm),[c148])).
% 26.55/26.75 cnf(c37,negated_conjecture,ssItem(skolem0005)|nil=skolem0003,inference(split_conjunct,status(thm),[c28])).
% 26.55/26.75 cnf(c691,plain,ssItem(skolem0005)|~duplicatefreeP(nil)|duplicatefreeP(skolem0003),inference(resolution,status(thm),[c37, c19])).
% 26.55/26.75 cnf(c28692,plain,ssItem(skolem0005)|duplicatefreeP(skolem0003),inference(resolution,status(thm),[c691, c146])).
% 26.55/26.75 cnf(c28708,plain,ssItem(skolem0005)|duplicatefreeP(skolem0001),inference(resolution,status(thm),[c28692, c655])).
% 26.55/26.75 cnf(c28724,plain,ssItem(skolem0005),inference(resolution,status(thm),[c28708, c35])).
% 26.55/26.75 cnf(c28739,plain,duplicatefreeP(cons(skolem0005,nil)),inference(resolution,status(thm),[c28724, c149])).
% 26.55/26.75 cnf(c43,negated_conjecture,cons(skolem0005,nil)=skolem0003|nil=skolem0003,inference(split_conjunct,status(thm),[c28])).
% 26.55/26.75 cnf(c839,plain,nil=skolem0003|~duplicatefreeP(cons(skolem0005,nil))|duplicatefreeP(skolem0003),inference(resolution,status(thm),[c43, c19])).
% 26.55/26.75 cnf(c41718,plain,nil=skolem0003|duplicatefreeP(skolem0003),inference(resolution,status(thm),[c839, c28739])).
% 26.55/26.75 cnf(c46815,plain,duplicatefreeP(skolem0003)|~duplicatefreeP(nil),inference(resolution,status(thm),[c41718, c19])).
% 26.55/26.75 cnf(c46820,plain,duplicatefreeP(skolem0003),inference(resolution,status(thm),[c46815, c146])).
% 26.55/26.75 cnf(c46821,plain,duplicatefreeP(skolem0001),inference(resolution,status(thm),[c46820, c655])).
% 26.55/26.75 cnf(c46822,plain,$false,inference(resolution,status(thm),[c46821, c35])).
% 26.55/26.75 # SZS output end CNFRefutation
% 26.55/26.75
% 26.55/26.75 # Initial clauses : 237
% 26.55/26.75 # Processed clauses : 1569
% 26.55/26.75 # Factors computed : 0
% 26.55/26.75 # Resolvents computed: 46304
% 26.55/26.75 # Tautologies deleted: 13
% 26.55/26.75 # Forward subsumed : 938
% 26.55/26.75 # Backward subsumed : 317
% 26.55/26.75 # -------- CPU Time ---------
% 26.55/26.75 # User time : 26.272 s
% 26.55/26.75 # System time : 0.114 s
% 26.55/26.75 # Total time : 26.386 s
%------------------------------------------------------------------------------