TSTP Solution File: SWC269+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC269+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n010.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:42 EDT 2022
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC269+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n010.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 03:39:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.60/0.81 # Version: 1.3
% 0.60/0.81 # SZS status Theorem
% 0.60/0.81 # SZS output start CNFRefutation
% 0.60/0.81 fof(co1,conjecture,(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((V!=X|U!=W)|(~frontsegP(X,W)))|(~totalorderedP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&frontsegP(X,Y))&segmentP(Y,W))&totalorderedP(Y))))|totalorderedP(U)))))))))),input).
% 0.60/0.81 fof(c23,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((V!=X|U!=W)|(~frontsegP(X,W)))|(~totalorderedP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&frontsegP(X,Y))&segmentP(Y,W))&totalorderedP(Y))))|totalorderedP(U))))))))))),inference(assume_negation,status(cth),[co1])).
% 0.60/0.81 fof(c24,negated_conjecture,(~(![U]:(ssList(U)=>(![V]:(ssList(V)=>(![W]:(ssList(W)=>(![X]:(ssList(X)=>(((((V!=X|U!=W)|~frontsegP(X,W))|~totalorderedP(W))|(?[Y]:((((ssList(Y)&neq(W,Y))&frontsegP(X,Y))&segmentP(Y,W))&totalorderedP(Y))))|totalorderedP(U))))))))))),inference(fof_simplification,status(thm),[c23])).
% 0.60/0.81 fof(c25,negated_conjecture,(?[U]:(ssList(U)&(?[V]:(ssList(V)&(?[W]:(ssList(W)&(?[X]:(ssList(X)&(((((V=X&U=W)&frontsegP(X,W))&totalorderedP(W))&(![Y]:((((~ssList(Y)|~neq(W,Y))|~frontsegP(X,Y))|~segmentP(Y,W))|~totalorderedP(Y))))&~totalorderedP(U)))))))))),inference(fof_nnf,status(thm),[c24])).
% 0.60/0.81 fof(c26,negated_conjecture,(?[X2]:(ssList(X2)&(?[X3]:(ssList(X3)&(?[X4]:(ssList(X4)&(?[X5]:(ssList(X5)&(((((X3=X5&X2=X4)&frontsegP(X5,X4))&totalorderedP(X4))&(![X6]:((((~ssList(X6)|~neq(X4,X6))|~frontsegP(X5,X6))|~segmentP(X6,X4))|~totalorderedP(X6))))&~totalorderedP(X2)))))))))),inference(variable_rename,status(thm),[c25])).
% 0.60/0.81 fof(c28,negated_conjecture,(![X6]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((((skolem0002=skolem0004&skolem0001=skolem0003)&frontsegP(skolem0004,skolem0003))&totalorderedP(skolem0003))&((((~ssList(X6)|~neq(skolem0003,X6))|~frontsegP(skolem0004,X6))|~segmentP(X6,skolem0003))|~totalorderedP(X6)))&~totalorderedP(skolem0001))))))),inference(shift_quantors,status(thm),[fof(c27,negated_conjecture,(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&(((((skolem0002=skolem0004&skolem0001=skolem0003)&frontsegP(skolem0004,skolem0003))&totalorderedP(skolem0003))&(![X6]:((((~ssList(X6)|~neq(skolem0003,X6))|~frontsegP(skolem0004,X6))|~segmentP(X6,skolem0003))|~totalorderedP(X6))))&~totalorderedP(skolem0001)))))),inference(skolemize,status(esa),[c26])).])).
% 0.60/0.81 cnf(c38,negated_conjecture,~totalorderedP(skolem0001),inference(split_conjunct,status(thm),[c28])).
% 0.60/0.81 cnf(c36,negated_conjecture,totalorderedP(skolem0003),inference(split_conjunct,status(thm),[c28])).
% 0.60/0.81 cnf(symmetry,axiom,X252!=X253|X253=X252,eq_axiom).
% 0.60/0.81 cnf(c34,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,status(thm),[c28])).
% 0.60/0.81 cnf(c519,plain,skolem0003=skolem0001,inference(resolution,status(thm),[c34, symmetry])).
% 0.60/0.81 cnf(c17,plain,X331!=X330|~totalorderedP(X331)|totalorderedP(X330),eq_axiom).
% 0.60/0.81 cnf(c636,plain,~totalorderedP(skolem0003)|totalorderedP(skolem0001),inference(resolution,status(thm),[c17, c519])).
% 0.60/0.81 cnf(c642,plain,totalorderedP(skolem0001),inference(resolution,status(thm),[c636, c36])).
% 0.60/0.81 cnf(c648,plain,$false,inference(resolution,status(thm),[c642, c38])).
% 0.60/0.81 # SZS output end CNFRefutation
% 0.60/0.81
% 0.60/0.81 # Initial clauses : 226
% 0.60/0.81 # Processed clauses : 111
% 0.60/0.81 # Factors computed : 0
% 0.60/0.81 # Resolvents computed: 141
% 0.60/0.81 # Tautologies deleted: 9
% 0.60/0.81 # Forward subsumed : 13
% 0.60/0.81 # Backward subsumed : 1
% 0.60/0.81 # -------- CPU Time ---------
% 0.60/0.81 # User time : 0.454 s
% 0.60/0.81 # System time : 0.015 s
% 0.60/0.81 # Total time : 0.469 s
%------------------------------------------------------------------------------