TSTP Solution File: SWC293+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC293+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n015.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:50 EDT 2022
% Result : Theorem 14.52s 14.74s
% Output : Refutation 14.52s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| strictorderedP(U)
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& ( nil != X
| nil != W ) ) ) ) ) ),
input ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| strictorderedP(U)
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& ( nil != X
| nil != W ) ) ) ) ) ),
inference(assume_negation,status(cth),[co1]) ).
fof(c24,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| strictorderedP(U)
| ( ! [Y] :
( ~ ssItem(Y)
| cons(Y,nil) != W
| ~ memberP(X,Y) )
& ( nil != X
| nil != W ) ) ) ) ) ),
inference(fof_simplification,status(thm),[c23]) ).
fof(c25,negated_conjecture,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ strictorderedP(U)
& ( ? [Y] :
( ssItem(Y)
& cons(Y,nil) = W
& memberP(X,Y) )
| ( nil = X
& nil = W ) ) ) ) ) ),
inference(fof_nnf,status(thm),[c24]) ).
fof(c26,negated_conjecture,
? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& X3 = X5
& X2 = X4
& ~ strictorderedP(X2)
& ( ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X4
& memberP(X5,X6) )
| ( nil = X5
& nil = X4 ) ) ) ) ) ),
inference(variable_rename,status(thm),[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ~ strictorderedP(skolem0001)
& ( ( ssItem(skolem0005)
& cons(skolem0005,nil) = skolem0003
& memberP(skolem0004,skolem0005) )
| ( nil = skolem0004
& nil = skolem0003 ) ) ),
inference(skolemize,status(esa),[c26]) ).
fof(c28,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ~ strictorderedP(skolem0001)
& ( ssItem(skolem0005)
| nil = skolem0004 )
& ( ssItem(skolem0005)
| nil = skolem0003 )
& ( cons(skolem0005,nil) = skolem0003
| nil = skolem0004 )
& ( cons(skolem0005,nil) = skolem0003
| nil = skolem0003 )
& ( memberP(skolem0004,skolem0005)
| nil = skolem0004 )
& ( memberP(skolem0004,skolem0005)
| nil = skolem0003 ) ),
inference(distribute,status(thm),[c27]) ).
cnf(c35,negated_conjecture,
~ strictorderedP(skolem0001),
inference(split_conjunct,status(thm),[c28]) ).
cnf(symmetry,axiom,
( X253 != X252
| X252 = X253 ),
eq_axiom ).
cnf(c34,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,status(thm),[c28]) ).
cnf(c517,plain,
skolem0003 = skolem0001,
inference(resolution,status(thm),[c34,symmetry]) ).
cnf(c18,plain,
( X334 != X333
| ~ strictorderedP(X334)
| strictorderedP(X333) ),
eq_axiom ).
cnf(c641,plain,
( ~ strictorderedP(skolem0003)
| strictorderedP(skolem0001) ),
inference(resolution,status(thm),[c18,c517]) ).
fof(ax69,axiom,
strictorderedP(nil),
input ).
cnf(c151,axiom,
strictorderedP(nil),
inference(split_conjunct,status(thm),[ax69]) ).
fof(ax68,axiom,
! [U] :
( ssItem(U)
=> strictorderedP(cons(U,nil)) ),
input ).
fof(c152,axiom,
! [U] :
( ~ ssItem(U)
| strictorderedP(cons(U,nil)) ),
inference(fof_nnf,status(thm),[ax68]) ).
fof(c153,axiom,
! [X55] :
( ~ ssItem(X55)
| strictorderedP(cons(X55,nil)) ),
inference(variable_rename,status(thm),[c152]) ).
cnf(c154,axiom,
( ~ ssItem(X352)
| strictorderedP(cons(X352,nil)) ),
inference(split_conjunct,status(thm),[c153]) ).
cnf(c37,negated_conjecture,
( ssItem(skolem0005)
| nil = skolem0003 ),
inference(split_conjunct,status(thm),[c28]) ).
cnf(c679,plain,
( ssItem(skolem0005)
| ~ strictorderedP(nil)
| strictorderedP(skolem0003) ),
inference(resolution,status(thm),[c37,c18]) ).
cnf(c25410,plain,
( ssItem(skolem0005)
| strictorderedP(skolem0003) ),
inference(resolution,status(thm),[c679,c151]) ).
cnf(c25426,plain,
( ssItem(skolem0005)
| strictorderedP(skolem0001) ),
inference(resolution,status(thm),[c25410,c641]) ).
cnf(c25442,plain,
ssItem(skolem0005),
inference(resolution,status(thm),[c25426,c35]) ).
cnf(c25456,plain,
strictorderedP(cons(skolem0005,nil)),
inference(resolution,status(thm),[c25442,c154]) ).
cnf(c39,negated_conjecture,
( cons(skolem0005,nil) = skolem0003
| nil = skolem0003 ),
inference(split_conjunct,status(thm),[c28]) ).
cnf(c743,plain,
( nil = skolem0003
| ~ strictorderedP(cons(skolem0005,nil))
| strictorderedP(skolem0003) ),
inference(resolution,status(thm),[c39,c18]) ).
cnf(c28689,plain,
( nil = skolem0003
| strictorderedP(skolem0003) ),
inference(resolution,status(thm),[c743,c25456]) ).
cnf(c30057,plain,
( strictorderedP(skolem0003)
| ~ strictorderedP(nil) ),
inference(resolution,status(thm),[c28689,c18]) ).
cnf(c30080,plain,
strictorderedP(skolem0003),
inference(resolution,status(thm),[c30057,c151]) ).
cnf(c30081,plain,
strictorderedP(skolem0001),
inference(resolution,status(thm),[c30080,c641]) ).
cnf(c30082,plain,
$false,
inference(resolution,status(thm),[c30081,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC293+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.34 % Computer : n015.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 23:02:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 14.52/14.74 # Version: 1.3
% 14.52/14.74 # SZS status Theorem
% 14.52/14.74 # SZS output start CNFRefutation
% See solution above
% 14.52/14.74
% 14.52/14.74 # Initial clauses : 229
% 14.52/14.74 # Processed clauses : 1287
% 14.52/14.74 # Factors computed : 0
% 14.52/14.74 # Resolvents computed: 29572
% 14.52/14.74 # Tautologies deleted: 13
% 14.52/14.74 # Forward subsumed : 738
% 14.52/14.74 # Backward subsumed : 300
% 14.52/14.74 # -------- CPU Time ---------
% 14.52/14.74 # User time : 14.328 s
% 14.52/14.74 # System time : 0.075 s
% 14.52/14.74 # Total time : 14.403 s
%------------------------------------------------------------------------------