TSTP Solution File: SWC276+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC276+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n012.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:44 EDT 2022
% Result : Theorem 14.94s 15.11s
% Output : Refutation 14.94s
% 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
| totalorderedP(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
| totalorderedP(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
| totalorderedP(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
& ~ totalorderedP(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
& ~ totalorderedP(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
& ~ totalorderedP(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
& ~ totalorderedP(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,
~ totalorderedP(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(c519,plain,
skolem0003 = skolem0001,
inference(resolution,status(thm),[c34,symmetry]) ).
cnf(c17,plain,
( X331 != X330
| ~ totalorderedP(X331)
| totalorderedP(X330) ),
eq_axiom ).
cnf(c638,plain,
( ~ totalorderedP(skolem0003)
| totalorderedP(skolem0001) ),
inference(resolution,status(thm),[c17,c519]) ).
fof(ax66,axiom,
totalorderedP(nil),
input ).
cnf(c164,axiom,
totalorderedP(nil),
inference(split_conjunct,status(thm),[ax66]) ).
fof(ax65,axiom,
! [U] :
( ssItem(U)
=> totalorderedP(cons(U,nil)) ),
input ).
fof(c165,axiom,
! [U] :
( ~ ssItem(U)
| totalorderedP(cons(U,nil)) ),
inference(fof_nnf,status(thm),[ax65]) ).
fof(c166,axiom,
! [X58] :
( ~ ssItem(X58)
| totalorderedP(cons(X58,nil)) ),
inference(variable_rename,status(thm),[c165]) ).
cnf(c167,axiom,
( ~ ssItem(X353)
| totalorderedP(cons(X353,nil)) ),
inference(split_conjunct,status(thm),[c166]) ).
cnf(c37,negated_conjecture,
( ssItem(skolem0005)
| nil = skolem0003 ),
inference(split_conjunct,status(thm),[c28]) ).
cnf(c676,plain,
( ssItem(skolem0005)
| ~ totalorderedP(nil)
| totalorderedP(skolem0003) ),
inference(resolution,status(thm),[c37,c17]) ).
cnf(c25481,plain,
( ssItem(skolem0005)
| totalorderedP(skolem0003) ),
inference(resolution,status(thm),[c676,c164]) ).
cnf(c25497,plain,
( ssItem(skolem0005)
| totalorderedP(skolem0001) ),
inference(resolution,status(thm),[c25481,c638]) ).
cnf(c25513,plain,
ssItem(skolem0005),
inference(resolution,status(thm),[c25497,c35]) ).
cnf(c25527,plain,
totalorderedP(cons(skolem0005,nil)),
inference(resolution,status(thm),[c25513,c167]) ).
cnf(c39,negated_conjecture,
( cons(skolem0005,nil) = skolem0003
| nil = skolem0003 ),
inference(split_conjunct,status(thm),[c28]) ).
cnf(c740,plain,
( nil = skolem0003
| ~ totalorderedP(cons(skolem0005,nil))
| totalorderedP(skolem0003) ),
inference(resolution,status(thm),[c39,c17]) ).
cnf(c28460,plain,
( nil = skolem0003
| totalorderedP(skolem0003) ),
inference(resolution,status(thm),[c740,c25527]) ).
cnf(c29979,plain,
( totalorderedP(skolem0003)
| ~ totalorderedP(nil) ),
inference(resolution,status(thm),[c28460,c17]) ).
cnf(c30007,plain,
totalorderedP(skolem0003),
inference(resolution,status(thm),[c29979,c164]) ).
cnf(c30008,plain,
totalorderedP(skolem0001),
inference(resolution,status(thm),[c30007,c638]) ).
cnf(c30009,plain,
$false,
inference(resolution,status(thm),[c30008,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SWC276+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 01:29:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 14.94/15.11 # Version: 1.3
% 14.94/15.11 # SZS status Theorem
% 14.94/15.11 # SZS output start CNFRefutation
% See solution above
% 14.94/15.11
% 14.94/15.11 # Initial clauses : 229
% 14.94/15.11 # Processed clauses : 1276
% 14.94/15.11 # Factors computed : 0
% 14.94/15.11 # Resolvents computed: 29499
% 14.94/15.11 # Tautologies deleted: 13
% 14.94/15.11 # Forward subsumed : 705
% 14.94/15.11 # Backward subsumed : 266
% 14.94/15.11 # -------- CPU Time ---------
% 14.94/15.11 # User time : 14.701 s
% 14.94/15.11 # System time : 0.070 s
% 14.94/15.11 # Total time : 14.771 s
%------------------------------------------------------------------------------