TSTP Solution File: SWC360+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC360+1 : TPTP v8.1.2. 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 : 300s
% DateTime : Thu May 9 17:43:56 EDT 2024
% Result : Theorem 6.27s 6.44s
% Output : Refutation 6.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC360+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 9 03:06:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 6.27/6.44 % Version: 1.5
% 6.27/6.44 % SZS status Theorem
% 6.27/6.44 % SZS output start CNFRefutation
% 6.27/6.44 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)))|(~totalorderedP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&totalorderedP(Y))))|segmentP(V,U)))))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p', co1)).
% 6.27/6.44 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)))|(~totalorderedP(W)))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&totalorderedP(Y))))|segmentP(V,U))))))))))),inference(assume_negation,[status(cth)],[co1])).
% 6.27/6.44 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))|~totalorderedP(W))|(?[Y]:((((ssList(Y)&neq(W,Y))&segmentP(X,Y))&segmentP(Y,W))&totalorderedP(Y))))|segmentP(V,U))))))))))),inference(fof_simplification,[status(thm)],[c23])).
% 6.27/6.44 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))&totalorderedP(W))&(![Y]:((((~ssList(Y)|~neq(W,Y))|~segmentP(X,Y))|~segmentP(Y,W))|~totalorderedP(Y))))&~segmentP(V,U)))))))))),inference(fof_nnf,[status(thm)],[c24])).
% 6.27/6.44 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))&totalorderedP(X4))&(![X6]:((((~ssList(X6)|~neq(X4,X6))|~segmentP(X5,X6))|~segmentP(X6,X4))|~totalorderedP(X6))))&~segmentP(X3,X2)))))))))),inference(variable_rename,[status(thm)],[c25])).
% 6.27/6.44 fof(c28,negated_conjecture,(![X6]:(ssList(skolem0001)&(ssList(skolem0002)&(ssList(skolem0003)&(ssList(skolem0004)&((((((skolem0002=skolem0004&skolem0001=skolem0003)&neq(skolem0002,nil))&segmentP(skolem0004,skolem0003))&totalorderedP(skolem0003))&((((~ssList(X6)|~neq(skolem0003,X6))|~segmentP(skolem0004,X6))|~segmentP(X6,skolem0003))|~totalorderedP(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))&totalorderedP(skolem0003))&(![X6]:((((~ssList(X6)|~neq(skolem0003,X6))|~segmentP(skolem0004,X6))|~segmentP(X6,skolem0003))|~totalorderedP(X6))))&~segmentP(skolem0002,skolem0001)))))),inference(skolemize,[status(esa)],[c26])).])).
% 6.27/6.44 cnf(c39,negated_conjecture,~segmentP(skolem0002,skolem0001),inference(split_conjunct,[status(thm)],[c28])).
% 6.27/6.44 cnf(symmetry,axiom,X253!=X252|X252=X253,theory(equality)).
% 6.27/6.44 cnf(c33,negated_conjecture,skolem0002=skolem0004,inference(split_conjunct,[status(thm)],[c28])).
% 6.27/6.44 cnf(c516,plain,skolem0004=skolem0002,inference(resolution,[status(thm)],[c33, symmetry])).
% 6.27/6.44 cnf(c34,negated_conjecture,skolem0001=skolem0003,inference(split_conjunct,[status(thm)],[c28])).
% 6.27/6.44 cnf(c519,plain,skolem0003=skolem0001,inference(resolution,[status(thm)],[c34, symmetry])).
% 6.27/6.44 cnf(c36,negated_conjecture,segmentP(skolem0004,skolem0003),inference(split_conjunct,[status(thm)],[c28])).
% 6.27/6.44 cnf(c11,axiom,X306!=X304|X307!=X305|~segmentP(X306,X307)|segmentP(X304,X305),theory(equality)).
% 6.27/6.44 cnf(c607,plain,skolem0004!=X800|skolem0003!=X801|segmentP(X800,X801),inference(resolution,[status(thm)],[c11, c36])).
% 6.27/6.44 cnf(c19328,plain,skolem0004!=X855|segmentP(X855,skolem0001),inference(resolution,[status(thm)],[c607, c519])).
% 6.27/6.44 cnf(c19539,plain,segmentP(skolem0002,skolem0001),inference(resolution,[status(thm)],[c19328, c516])).
% 6.27/6.44 cnf(c19546,plain,$false,inference(resolution,[status(thm)],[c19539, c39])).
% 6.27/6.44 % SZS output end CNFRefutation
% 6.27/6.44
% 6.27/6.44 % Initial clauses : 227
% 6.27/6.44 % Processed clauses : 919
% 6.27/6.44 % Factors computed : 44
% 6.27/6.44 % Resolvents computed: 18998
% 6.27/6.44 % Tautologies deleted: 21
% 6.27/6.44 % Forward subsumed : 348
% 6.27/6.44 % Backward subsumed : 1
% 6.27/6.44 % -------- CPU Time ---------
% 6.27/6.44 % User time : 6.050 s
% 6.27/6.44 % System time : 0.041 s
% 6.27/6.44 % Total time : 6.091 s
%------------------------------------------------------------------------------