TSTP Solution File: SWC291+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC291+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n009.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:49 EDT 2022
% Result : Theorem 0.70s 0.88s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC291+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 12 21:25:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/0.88 # Version: 1.3
% 0.70/0.88 # SZS status Theorem
% 0.70/0.88 # SZS output start CNFRefutation
% 0.70/0.88 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((V!=X|U!=W)|(~segmentP(X,W)))|(~strictorderedP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&strictorderedP(Y))))|strictorderedP(U)))))))))),input).
% 0.70/0.88 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((V!=X|U!=W)|(~segmentP(X,W)))|(~strictorderedP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&strictorderedP(Y))))|strictorderedP(U))))))))))),inference(assume_negation,status(cth),[co1])).
% 0.70/0.88 fof(c24,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((V!=X|U!=W)|~segmentP(X,W))|~strictorderedP(W))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&strictorderedP(Y))))|strictorderedP(U))))))))))),inference(fof_simplification,status(thm),[c23])).
% 0.70/0.88 fof(c25,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&(((((V=X&U=W)&segmentP(X,W))&strictorderedP(W))&(![Y]:((((~ssList(Y)|~neq(W,Y))|~segmentP(X,Y))|~segmentP(Y,W))|~strictorderedP(Y))))&~strictorderedP(U)))))))))),inference(fof_nnf,status(thm),[c24])).
% 0.70/0.88 fof(c26,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:(ssList(X5)&(((((X3=X5&X2=X4)&segmentP(X5,X4))&strictorderedP(X4))&(![X6]:((((~ssList(X6)|~neq(X4,X6))|~segmentP(X5,X6))|~segmentP(X6,X4))|~strictorderedP(X6))))&~strictorderedP(X2)))))))))),inference(variable_rename,status(thm),[c25])).
% 0.70/0.88 fof(c28,negated_conjecture,(![X6]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((((skolem0002=skolem0004&skolem0001=skolem0003)&segmentP(skolem0004,skolem0003))&strictorderedP(skolem0003))&((((~ssList(X6)|~neq(skolem0003,X6))|~segmentP(skolem0004,X6))|~segmentP(X6,skolem0003))|~strictorderedP(X6)))&~strictorderedP(skolem0001))))))),inference(shift_quantors,status(thm),[fof(c27,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((((skolem0002=skolem0004&skolem0001=skolem0003)&segmentP(skolem0004,skolem0003))&strictorderedP(skolem0003))&(![X6]:((((~ssList(X6)|~neq(skolem0003,X6))|~segmentP(skolem0004,X6))|~segmentP(X6,skolem0003))|~strictorderedP(X6))))&~strictorderedP(skolem0001)))))),inference(skolemize,status(esa),[c26])).])).
% 0.70/0.88 cnf(c38,negated_conjecture,~strictorderedP(skolem0001),inference(split_conjunct,status(thm),[c28])).
% 0.70/0.88 cnf(c36,negated_conjecture,strictorderedP(skolem0003),inference(split_conjunct,status(thm),[c28])).
% 0.70/0.88 cnf(symmetry,axiom,X252!=X253|X253=X252,eq_axiom).
% 0.70/0.88 cnf(c34,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,status(thm),[c28])).
% 0.70/0.88 cnf(c519,plain,skolem0003=skolem0001,inference(resolution,status(thm),[c34, symmetry])).
% 0.70/0.88 cnf(c18,plain,X334!=X333|~strictorderedP(X334)|strictorderedP(X333),eq_axiom).
% 0.70/0.88 cnf(c641,plain,~strictorderedP(skolem0003)|strictorderedP(skolem0001),inference(resolution,status(thm),[c18, c519])).
% 0.70/0.88 cnf(c647,plain,strictorderedP(skolem0001),inference(resolution,status(thm),[c641, c36])).
% 0.70/0.88 cnf(c653,plain,$false,inference(resolution,status(thm),[c647, c38])).
% 0.70/0.88 # SZS output end CNFRefutation
% 0.70/0.88
% 0.70/0.88 # Initial clauses : 226
% 0.70/0.88 # Processed clauses : 116
% 0.70/0.88 # Factors computed : 0
% 0.70/0.88 # Resolvents computed: 146
% 0.70/0.88 # Tautologies deleted: 10
% 0.70/0.88 # Forward subsumed : 13
% 0.70/0.88 # Backward subsumed : 1
% 0.70/0.88 # -------- CPU Time ---------
% 0.70/0.88 # User time : 0.510 s
% 0.70/0.88 # System time : 0.019 s
% 0.70/0.88 # Total time : 0.529 s
%------------------------------------------------------------------------------