TSTP Solution File: SWC130+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC130+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n024.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:00 EDT 2022
% Result : Theorem 283.24s 283.54s
% Output : Refutation 283.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC130+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 08:02:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 283.24/283.54 # Version: 1.3
% 283.24/283.54 # SZS status Theorem
% 283.24/283.54 # SZS output start CNFRefutation
% 283.24/283.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).
% 283.24/283.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])).
% 283.24/283.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])).
% 283.24/283.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])).
% 283.24/283.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])).
% 283.24/283.54 cnf(c34,negated_conjecture,~cyclefreeP(skolem0002),inference(split_conjunct,status(thm),[c26])).
% 283.24/283.54 cnf(symmetry,axiom,X252!=X251|X251=X252,eq_axiom).
% 283.24/283.54 cnf(c31,negated_conjecture,skolem0002=skolem0004,inference(split_conjunct,status(thm),[c26])).
% 283.24/283.54 cnf(c508,plain,skolem0004=skolem0002,inference(resolution,status(thm),[c31, symmetry])).
% 283.24/283.54 cnf(c12,plain,X312!=X311|~cyclefreeP(X312)|cyclefreeP(X311),eq_axiom).
% 283.24/283.54 cnf(c610,plain,~cyclefreeP(skolem0004)|cyclefreeP(skolem0002),inference(resolution,status(thm),[c12, c508])).
% 283.24/283.54 fof(ax60,axiom,cyclefreeP(nil),input).
% 283.24/283.54 cnf(c169,axiom,cyclefreeP(nil),inference(split_conjunct,status(thm),[ax60])).
% 283.24/283.54 cnf(c33,negated_conjecture,~neq(skolem0004,nil),inference(split_conjunct,status(thm),[c26])).
% 283.24/283.54 cnf(c30,negated_conjecture,ssList(skolem0004),inference(split_conjunct,status(thm),[c26])).
% 283.24/283.54 fof(ax17,axiom,ssList(nil),input).
% 283.24/283.54 cnf(c347,axiom,ssList(nil),inference(split_conjunct,status(thm),[ax17])).
% 283.24/283.54 fof(ax15,axiom,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(neq(U,V)<=>U!=V))))),input).
% 283.24/283.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])).
% 283.24/283.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])).])).
% 283.24/283.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])).
% 283.24/283.54 cnf(c357,axiom,~ssList(X567)|~ssList(X568)|X567=X568|neq(X567,X568),inference(split_conjunct,status(thm),[c355])).
% 283.24/283.54 cnf(c6905,plain,~ssList(X1227)|X1227=nil|neq(X1227,nil),inference(resolution,status(thm),[c357, c347])).
% 283.24/283.54 cnf(c267077,plain,skolem0004=nil|neq(skolem0004,nil),inference(resolution,status(thm),[c6905, c30])).
% 283.24/283.54 cnf(c268109,plain,skolem0004=nil,inference(resolution,status(thm),[c267077, c33])).
% 283.24/283.54 cnf(c268216,plain,nil=skolem0004,inference(resolution,status(thm),[c268109, symmetry])).
% 283.24/283.54 cnf(c269296,plain,~cyclefreeP(nil)|cyclefreeP(skolem0004),inference(resolution,status(thm),[c268216, c12])).
% 283.24/283.54 cnf(c270499,plain,cyclefreeP(skolem0004),inference(resolution,status(thm),[c269296, c169])).
% 283.24/283.54 cnf(c270502,plain,cyclefreeP(skolem0002),inference(resolution,status(thm),[c270499, c610])).
% 283.24/283.54 cnf(c270515,plain,$false,inference(resolution,status(thm),[c270502, c34])).
% 283.24/283.54 # SZS output end CNFRefutation
% 283.24/283.54
% 283.24/283.54 # Initial clauses : 224
% 283.24/283.54 # Processed clauses : 4319
% 283.24/283.54 # Factors computed : 1
% 283.24/283.54 # Resolvents computed: 270011
% 283.24/283.54 # Tautologies deleted: 15
% 283.24/283.54 # Forward subsumed : 2339
% 283.24/283.54 # Backward subsumed : 801
% 283.24/283.54 # -------- CPU Time ---------
% 283.24/283.54 # User time : 282.558 s
% 283.24/283.54 # System time : 0.546 s
% 283.24/283.54 # Total time : 283.104 s
%------------------------------------------------------------------------------