TSTP Solution File: SWC102+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n008.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:51 EDT 2022
% Result : Theorem 14.45s 14.69s
% Output : Refutation 14.45s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named eq_axiom)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| X != W
| ~ neq(V,nil)
| ( neq(U,nil)
& frontsegP(V,U) ) ) ) ) ) ),
input ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| X != W
| ~ neq(V,nil)
| ( neq(U,nil)
& frontsegP(V,U) ) ) ) ) ) ),
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
| X != W
| ~ neq(V,nil)
| ( neq(U,nil)
& frontsegP(V,U) ) ) ) ) ) ),
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
& X = W
& neq(V,nil)
& ( ~ neq(U,nil)
| ~ frontsegP(V,U) ) ) ) ) ),
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
& X5 = X4
& neq(X3,nil)
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ),
inference(variable_rename,status(thm),[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& skolem0004 = skolem0003
& neq(skolem0002,nil)
& ( ~ neq(skolem0001,nil)
| ~ frontsegP(skolem0002,skolem0001) ) ),
inference(skolemize,status(esa),[c26]) ).
cnf(c32,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,status(thm),[c27]) ).
cnf(transitivity,axiom,
( X254 != X255
| X255 != X253
| X254 = X253 ),
eq_axiom ).
cnf(c34,negated_conjecture,
skolem0004 = skolem0003,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c515,plain,
( X378 != skolem0004
| X378 = skolem0003 ),
inference(resolution,status(thm),[c34,transitivity]) ).
cnf(c715,plain,
skolem0002 = skolem0003,
inference(resolution,status(thm),[c515,c32]) ).
cnf(symmetry,axiom,
( X251 != X252
| X252 = X251 ),
eq_axiom ).
cnf(c33,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c514,plain,
skolem0003 = skolem0001,
inference(resolution,status(thm),[c33,symmetry]) ).
cnf(c526,plain,
( X391 != skolem0003
| X391 = skolem0001 ),
inference(resolution,status(thm),[c514,transitivity]) ).
cnf(c771,plain,
skolem0002 = skolem0001,
inference(resolution,status(thm),[c526,c715]) ).
cnf(reflexivity,axiom,
X250 = X250,
eq_axiom ).
cnf(c35,negated_conjecture,
neq(skolem0002,nil),
inference(split_conjunct,status(thm),[c27]) ).
cnf(c5,plain,
( X279 != X277
| X276 != X278
| ~ neq(X279,X276)
| neq(X277,X278) ),
eq_axiom ).
cnf(c567,plain,
( skolem0002 != X732
| nil != X733
| neq(X732,X733) ),
inference(resolution,status(thm),[c5,c35]) ).
cnf(c21953,plain,
( skolem0002 != X858
| neq(X858,nil) ),
inference(resolution,status(thm),[c567,reflexivity]) ).
cnf(c39947,plain,
neq(skolem0001,nil),
inference(resolution,status(thm),[c21953,c771]) ).
cnf(c36,negated_conjecture,
( ~ neq(skolem0001,nil)
| ~ frontsegP(skolem0002,skolem0001) ),
inference(split_conjunct,status(thm),[c27]) ).
cnf(c727,plain,
skolem0003 = skolem0002,
inference(resolution,status(thm),[c715,symmetry]) ).
cnf(c30,negated_conjecture,
ssList(skolem0003),
inference(split_conjunct,status(thm),[c27]) ).
fof(ax42,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,U) ),
input ).
fof(c240,axiom,
! [U] :
( ~ ssList(U)
| frontsegP(U,U) ),
inference(fof_nnf,status(thm),[ax42]) ).
fof(c241,axiom,
! [X93] :
( ~ ssList(X93)
| frontsegP(X93,X93) ),
inference(variable_rename,status(thm),[c240]) ).
cnf(c242,axiom,
( ~ ssList(X283)
| frontsegP(X283,X283) ),
inference(split_conjunct,status(thm),[c241]) ).
cnf(c579,plain,
frontsegP(skolem0003,skolem0003),
inference(resolution,status(thm),[c242,c30]) ).
cnf(c9,plain,
( X296 != X294
| X293 != X295
| ~ frontsegP(X296,X293)
| frontsegP(X294,X295) ),
eq_axiom ).
cnf(c594,plain,
( skolem0003 != X734
| skolem0003 != X735
| frontsegP(X734,X735) ),
inference(resolution,status(thm),[c9,c579]) ).
cnf(c21978,plain,
( skolem0003 != X860
| frontsegP(X860,skolem0001) ),
inference(resolution,status(thm),[c594,c514]) ).
cnf(c40099,plain,
frontsegP(skolem0002,skolem0001),
inference(resolution,status(thm),[c21978,c727]) ).
cnf(c40110,plain,
~ neq(skolem0001,nil),
inference(resolution,status(thm),[c40099,c36]) ).
cnf(c40269,plain,
$false,
inference(resolution,status(thm),[c40110,c39947]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33 % Computer : n008.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 09:31:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 14.45/14.69 # Version: 1.3
% 14.45/14.69 # SZS status Theorem
% 14.45/14.69 # SZS output start CNFRefutation
% See solution above
% 14.45/14.69
% 14.45/14.69 # Initial clauses : 225
% 14.45/14.69 # Processed clauses : 1224
% 14.45/14.69 # Factors computed : 0
% 14.45/14.69 # Resolvents computed: 39764
% 14.45/14.69 # Tautologies deleted: 15
% 14.45/14.69 # Forward subsumed : 772
% 14.45/14.69 # Backward subsumed : 1
% 14.45/14.69 # -------- CPU Time ---------
% 14.45/14.69 # User time : 14.250 s
% 14.45/14.69 # System time : 0.078 s
% 14.45/14.69 # Total time : 14.328 s
%------------------------------------------------------------------------------