TSTP Solution File: SWC040+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC040+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n020.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:47:33 EDT 2022
% Result : Theorem 0.76s 0.93s
% Output : Refutation 0.76s
% 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)
=> ( nil != V
| V != X
| U != W
| nil = U
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != W
| app(Z,cons(Y,nil)) != X ) ) )
& neq(X,nil) ) ) ) ) ) ),
input ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| nil = U
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ( app(cons(Y,nil),Z) != W
| app(Z,cons(Y,nil)) != X ) ) )
& neq(X,nil) ) ) ) ) ) ),
inference(assume_negation,status(cth),[co1]) ).
fof(c24,negated_conjecture,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = V
& V = X
& U = W
& nil != U
& ( nil = W
| nil != X )
& ( ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& app(cons(Y,nil),Z) = W
& app(Z,cons(Y,nil)) = X ) )
| ~ neq(X,nil) ) ) ) ) ),
inference(fof_nnf,status(thm),[c23]) ).
fof(c25,negated_conjecture,
? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& nil = X3
& X3 = X5
& X2 = X4
& nil != X2
& ( nil = X4
| nil != X5 )
& ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X4
& app(X7,cons(X6,nil)) = X5 ) )
| ~ neq(X5,nil) ) ) ) ) ),
inference(variable_rename,status(thm),[c24]) ).
fof(c26,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& nil = skolem0002
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& nil != skolem0001
& ( nil = skolem0003
| nil != skolem0004 )
& ( ( ssItem(skolem0005)
& ssList(skolem0006)
& app(cons(skolem0005,nil),skolem0006) = skolem0003
& app(skolem0006,cons(skolem0005,nil)) = skolem0004 )
| ~ neq(skolem0004,nil) ) ),
inference(skolemize,status(esa),[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& nil = skolem0002
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& nil != skolem0001
& ( nil = skolem0003
| nil != skolem0004 )
& ( ssItem(skolem0005)
| ~ neq(skolem0004,nil) )
& ( ssList(skolem0006)
| ~ neq(skolem0004,nil) )
& ( app(cons(skolem0005,nil),skolem0006) = skolem0003
| ~ neq(skolem0004,nil) )
& ( app(skolem0006,cons(skolem0005,nil)) = skolem0004
| ~ neq(skolem0004,nil) ) ),
inference(distribute,status(thm),[c26]) ).
cnf(c35,negated_conjecture,
nil != skolem0001,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c36,negated_conjecture,
( nil = skolem0003
| nil != skolem0004 ),
inference(split_conjunct,status(thm),[c27]) ).
cnf(c32,negated_conjecture,
nil = skolem0002,
inference(split_conjunct,status(thm),[c27]) ).
cnf(transitivity,axiom,
( X255 != X257
| X257 != X256
| X255 = X256 ),
eq_axiom ).
cnf(c33,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c516,plain,
( X373 != skolem0002
| X373 = skolem0004 ),
inference(resolution,status(thm),[c33,transitivity]) ).
cnf(c727,plain,
nil = skolem0004,
inference(resolution,status(thm),[c516,c32]) ).
cnf(c742,plain,
nil = skolem0003,
inference(resolution,status(thm),[c727,c36]) ).
cnf(symmetry,axiom,
( X253 != X254
| X254 = X253 ),
eq_axiom ).
cnf(c34,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c520,plain,
skolem0003 = skolem0001,
inference(resolution,status(thm),[c34,symmetry]) ).
cnf(c534,plain,
( X426 != skolem0003
| X426 = skolem0001 ),
inference(resolution,status(thm),[c520,transitivity]) ).
cnf(c963,plain,
nil = skolem0001,
inference(resolution,status(thm),[c534,c742]) ).
cnf(c1003,plain,
$false,
inference(resolution,status(thm),[c963,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC040+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n020.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 02:00:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/0.93 # Version: 1.3
% 0.76/0.93 # SZS status Theorem
% 0.76/0.93 # SZS output start CNFRefutation
% See solution above
% 0.76/0.93
% 0.76/0.93 # Initial clauses : 229
% 0.76/0.93 # Processed clauses : 257
% 0.76/0.93 # Factors computed : 0
% 0.76/0.93 # Resolvents computed: 513
% 0.76/0.93 # Tautologies deleted: 13
% 0.76/0.93 # Forward subsumed : 105
% 0.76/0.93 # Backward subsumed : 43
% 0.76/0.93 # -------- CPU Time ---------
% 0.76/0.93 # User time : 0.580 s
% 0.76/0.93 # System time : 0.015 s
% 0.76/0.93 # Total time : 0.595 s
%------------------------------------------------------------------------------