TSTP Solution File: SWC349+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC349+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:49:06 EDT 2022
% Result : Theorem 5.72s 5.94s
% Output : Refutation 5.72s
% 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 != W
| V != X
| U != W
| ~ neq(V,nil)
| frontsegP(V,U) ) ) ) ) ),
input ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != W
| V != X
| U != W
| ~ neq(V,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)
=> ( nil != W
| V != X
| U != W
| ~ neq(V,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)
& nil = W
& V = X
& U = W
& neq(V,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)
& nil = X4
& X3 = X5
& X2 = X4
& neq(X3,nil)
& ~ frontsegP(X3,X2) ) ) ) ),
inference(variable_rename,status(thm),[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& nil = skolem0003
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& neq(skolem0002,nil)
& ~ frontsegP(skolem0002,skolem0001) ),
inference(skolemize,status(esa),[c26]) ).
cnf(c36,negated_conjecture,
~ frontsegP(skolem0002,skolem0001),
inference(split_conjunct,status(thm),[c27]) ).
cnf(symmetry,axiom,
( X251 != X252
| X252 = X251 ),
eq_axiom ).
cnf(c33,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c514,plain,
skolem0004 = skolem0002,
inference(resolution,status(thm),[c33,symmetry]) ).
cnf(c34,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,status(thm),[c27]) ).
cnf(transitivity,axiom,
( X254 != X255
| X255 != X253
| X254 = X253 ),
eq_axiom ).
cnf(c32,negated_conjecture,
nil = skolem0003,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c511,plain,
skolem0003 = nil,
inference(resolution,status(thm),[c32,symmetry]) ).
cnf(c522,plain,
( X388 != skolem0003
| X388 = nil ),
inference(resolution,status(thm),[c511,transitivity]) ).
cnf(c748,plain,
skolem0001 = nil,
inference(resolution,status(thm),[c522,c34]) ).
cnf(c758,plain,
nil = skolem0001,
inference(resolution,status(thm),[c748,symmetry]) ).
cnf(c9,plain,
( X296 != X295
| X294 != X293
| ~ frontsegP(X296,X294)
| frontsegP(X295,X293) ),
eq_axiom ).
cnf(c31,negated_conjecture,
ssList(skolem0004),
inference(split_conjunct,status(thm),[c27]) ).
fof(ax45,axiom,
! [U] :
( ssList(U)
=> frontsegP(U,nil) ),
input ).
fof(c226,axiom,
! [U] :
( ~ ssList(U)
| frontsegP(U,nil) ),
inference(fof_nnf,status(thm),[ax45]) ).
fof(c227,axiom,
! [X85] :
( ~ ssList(X85)
| frontsegP(X85,nil) ),
inference(variable_rename,status(thm),[c226]) ).
cnf(c228,axiom,
( ~ ssList(X302)
| frontsegP(X302,nil) ),
inference(split_conjunct,status(thm),[c227]) ).
cnf(c615,plain,
frontsegP(skolem0004,nil),
inference(resolution,status(thm),[c228,c31]) ).
cnf(c628,plain,
( skolem0004 != X807
| nil != X806
| frontsegP(X807,X806) ),
inference(resolution,status(thm),[c615,c9]) ).
cnf(c14736,plain,
( skolem0004 != X891
| frontsegP(X891,skolem0001) ),
inference(resolution,status(thm),[c628,c758]) ).
cnf(c16898,plain,
frontsegP(skolem0002,skolem0001),
inference(resolution,status(thm),[c14736,c514]) ).
cnf(c16906,plain,
$false,
inference(resolution,status(thm),[c16898,c36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC349+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n020.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 22:36:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 5.72/5.94 # Version: 1.3
% 5.72/5.94 # SZS status Theorem
% 5.72/5.94 # SZS output start CNFRefutation
% See solution above
% 5.72/5.94
% 5.72/5.94 # Initial clauses : 225
% 5.72/5.94 # Processed clauses : 993
% 5.72/5.94 # Factors computed : 0
% 5.72/5.94 # Resolvents computed: 16528
% 5.72/5.94 # Tautologies deleted: 15
% 5.72/5.94 # Forward subsumed : 528
% 5.72/5.94 # Backward subsumed : 20
% 5.72/5.94 # -------- CPU Time ---------
% 5.72/5.94 # User time : 5.538 s
% 5.72/5.94 # System time : 0.041 s
% 5.72/5.94 # Total time : 5.579 s
%------------------------------------------------------------------------------