TSTP Solution File: SWC359+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC359+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:49:09 EDT 2022
% Result : Theorem 5.28s 5.47s
% Output : Refutation 5.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC359+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 21:42:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 5.28/5.47 # Version: 1.3
% 5.28/5.47 # SZS status Theorem
% 5.28/5.47 # SZS output start CNFRefutation
% 5.28/5.47 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>((((((V!=X|U!=W)|(~neq(V,nil)))|(~segmentP(X,W)))|(~equalelemsP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&equalelemsP(Y))))|segmentP(V,U)))))))))),input).
% 5.28/5.47 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>((((((V!=X|U!=W)|(~neq(V,nil)))|(~segmentP(X,W)))|(~equalelemsP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&equalelemsP(Y))))|segmentP(V,U))))))))))),inference(assume_negation,status(cth),[co1])).
% 5.28/5.47 fof(c24,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>((((((V!=X|U!=W)|~neq(V,nil))|~segmentP(X,W))|~equalelemsP(W))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&equalelemsP(Y))))|segmentP(V,U))))))))))),inference(fof_simplification,status(thm),[c23])).
% 5.28/5.47 fof(c25,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&((((((V=X&U=W)&neq(V,nil))&segmentP(X,W))&equalelemsP(W))&(![Y]:((((~ssList(Y)|~neq(W,Y))|~segmentP(X,Y))|~segmentP(Y,W))|~equalelemsP(Y))))&~segmentP(V,U)))))))))),inference(fof_nnf,status(thm),[c24])).
% 5.28/5.47 fof(c26,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:(ssList(X5)&((((((X3=X5&X2=X4)&neq(X3,nil))&segmentP(X5,X4))&equalelemsP(X4))&(![X6]:((((~ssList(X6)|~neq(X4,X6))|~segmentP(X5,X6))|~segmentP(X6,X4))|~equalelemsP(X6))))&~segmentP(X3,X2)))))))))),inference(variable_rename,status(thm),[c25])).
% 5.28/5.47 fof(c28,negated_conjecture,(![X6]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&((((((skolem0002=skolem0004&skolem0001=skolem0003)&neq(skolem0002,nil))&segmentP(skolem0004,skolem0003))&equalelemsP(skolem0003))&((((~ssList(X6)|~neq(skolem0003,X6))|~segmentP(skolem0004,X6))|~segmentP(X6,skolem0003))|~equalelemsP(X6)))&~segmentP(skolem0002,skolem0001))))))),inference(shift_quantors,status(thm),[fof(c27,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&((((((skolem0002=skolem0004&skolem0001=skolem0003)&neq(skolem0002,nil))&segmentP(skolem0004,skolem0003))&equalelemsP(skolem0003))&(![X6]:((((~ssList(X6)|~neq(skolem0003,X6))|~segmentP(skolem0004,X6))|~segmentP(X6,skolem0003))|~equalelemsP(X6))))&~segmentP(skolem0002,skolem0001)))))),inference(skolemize,status(esa),[c26])).])).
% 5.28/5.47 cnf(c39,negated_conjecture,~segmentP(skolem0002,skolem0001),inference(split_conjunct,status(thm),[c28])).
% 5.28/5.47 cnf(symmetry,axiom,X252!=X253|X253=X252,eq_axiom).
% 5.28/5.47 cnf(c33,negated_conjecture,skolem0002=skolem0004,inference(split_conjunct,status(thm),[c28])).
% 5.28/5.47 cnf(c513,plain,skolem0004=skolem0002,inference(resolution,status(thm),[c33, symmetry])).
% 5.28/5.47 cnf(c34,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,status(thm),[c28])).
% 5.28/5.47 cnf(c516,plain,skolem0003=skolem0001,inference(resolution,status(thm),[c34, symmetry])).
% 5.28/5.47 cnf(c36,negated_conjecture,segmentP(skolem0004,skolem0003),inference(split_conjunct,status(thm),[c28])).
% 5.28/5.47 cnf(c11,plain,X304!=X306|X307!=X305|~segmentP(X304,X307)|segmentP(X306,X305),eq_axiom).
% 5.28/5.47 cnf(c610,plain,skolem0004!=X788|skolem0003!=X789|segmentP(X788,X789),inference(resolution,status(thm),[c11, c36])).
% 5.28/5.47 cnf(c19387,plain,skolem0004!=X820|segmentP(X820,skolem0001),inference(resolution,status(thm),[c610, c516])).
% 5.28/5.47 cnf(c19578,plain,segmentP(skolem0002,skolem0001),inference(resolution,status(thm),[c19387, c513])).
% 5.28/5.47 cnf(c19595,plain,$false,inference(resolution,status(thm),[c19578, c39])).
% 5.28/5.47 # SZS output end CNFRefutation
% 5.28/5.47
% 5.28/5.47 # Initial clauses : 227
% 5.28/5.47 # Processed clauses : 932
% 5.28/5.47 # Factors computed : 0
% 5.28/5.47 # Resolvents computed: 19087
% 5.28/5.47 # Tautologies deleted: 13
% 5.28/5.47 # Forward subsumed : 342
% 5.28/5.47 # Backward subsumed : 1
% 5.28/5.47 # -------- CPU Time ---------
% 5.28/5.47 # User time : 5.086 s
% 5.28/5.47 # System time : 0.048 s
% 5.28/5.47 # Total time : 5.134 s
%------------------------------------------------------------------------------