TSTP Solution File: SWC044+1 by PyRes---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.3
% Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n019.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:34 EDT 2022
% Result : Theorem 5.63s 5.83s
% Output : Refutation 5.63s
% 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)
=> ( nil != V
| V != X
| U != W
| ~ rearsegP(X,W)
| nil = U ) ) ) ) ),
input ).
fof(c23,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| ~ rearsegP(X,W)
| nil = U ) ) ) ) ),
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
| ~ rearsegP(X,W)
| nil = U ) ) ) ) ),
inference(fof_simplification,status(thm),[c23]) ).
fof(c25,negated_conjecture,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = V
& V = X
& U = W
& rearsegP(X,W)
& nil != U ) ) ) ),
inference(fof_nnf,status(thm),[c24]) ).
fof(c26,negated_conjecture,
? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& nil = X3
& X3 = X5
& X2 = X4
& rearsegP(X5,X4)
& nil != X2 ) ) ) ),
inference(variable_rename,status(thm),[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& nil = skolem0002
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& rearsegP(skolem0004,skolem0003)
& nil != skolem0001 ),
inference(skolemize,status(esa),[c26]) ).
cnf(c36,negated_conjecture,
nil != skolem0001,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c28,negated_conjecture,
ssList(skolem0001),
inference(split_conjunct,status(thm),[c27]) ).
fof(ax52,axiom,
! [U] :
( ssList(U)
=> ( rearsegP(nil,U)
<=> nil = U ) ),
input ).
fof(c198,axiom,
! [U] :
( ~ ssList(U)
| ( ( ~ rearsegP(nil,U)
| nil = U )
& ( nil != U
| rearsegP(nil,U) ) ) ),
inference(fof_nnf,status(thm),[ax52]) ).
fof(c199,axiom,
! [X73] :
( ~ ssList(X73)
| ( ( ~ rearsegP(nil,X73)
| nil = X73 )
& ( nil != X73
| rearsegP(nil,X73) ) ) ),
inference(variable_rename,status(thm),[c198]) ).
fof(c200,axiom,
! [X73] :
( ( ~ ssList(X73)
| ~ rearsegP(nil,X73)
| nil = X73 )
& ( ~ ssList(X73)
| nil != X73
| rearsegP(nil,X73) ) ),
inference(distribute,status(thm),[c199]) ).
cnf(c201,axiom,
( ~ ssList(X450)
| ~ rearsegP(nil,X450)
| nil = X450 ),
inference(split_conjunct,status(thm),[c200]) ).
cnf(symmetry,axiom,
( X252 != X251
| X251 = X252 ),
eq_axiom ).
cnf(c32,negated_conjecture,
nil = skolem0002,
inference(split_conjunct,status(thm),[c27]) ).
cnf(transitivity,axiom,
( X255 != X253
| X253 != X254
| X255 = X254 ),
eq_axiom ).
cnf(c33,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c513,plain,
( X384 != skolem0002
| X384 = skolem0004 ),
inference(resolution,status(thm),[c33,transitivity]) ).
cnf(c743,plain,
nil = skolem0004,
inference(resolution,status(thm),[c513,c32]) ).
cnf(c760,plain,
skolem0004 = nil,
inference(resolution,status(thm),[c743,symmetry]) ).
cnf(c34,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,status(thm),[c27]) ).
cnf(c517,plain,
skolem0003 = skolem0001,
inference(resolution,status(thm),[c34,symmetry]) ).
cnf(c35,negated_conjecture,
rearsegP(skolem0004,skolem0003),
inference(split_conjunct,status(thm),[c27]) ).
cnf(c10,plain,
( X300 != X298
| X301 != X299
| ~ rearsegP(X300,X301)
| rearsegP(X298,X299) ),
eq_axiom ).
cnf(c606,plain,
( skolem0004 != X756
| skolem0003 != X755
| rearsegP(X756,X755) ),
inference(resolution,status(thm),[c10,c35]) ).
cnf(c14903,plain,
( skolem0004 != X801
| rearsegP(X801,skolem0001) ),
inference(resolution,status(thm),[c606,c517]) ).
cnf(c15238,plain,
rearsegP(nil,skolem0001),
inference(resolution,status(thm),[c14903,c760]) ).
cnf(c15257,plain,
( ~ ssList(skolem0001)
| nil = skolem0001 ),
inference(resolution,status(thm),[c15238,c201]) ).
cnf(c17458,plain,
nil = skolem0001,
inference(resolution,status(thm),[c15257,c28]) ).
cnf(c17486,plain,
$false,
inference(resolution,status(thm),[c17458,c36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n019.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 05:11:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 5.63/5.83 # Version: 1.3
% 5.63/5.83 # SZS status Theorem
% 5.63/5.83 # SZS output start CNFRefutation
% See solution above
% 5.63/5.83
% 5.63/5.83 # Initial clauses : 225
% 5.63/5.83 # Processed clauses : 1000
% 5.63/5.83 # Factors computed : 0
% 5.63/5.83 # Resolvents computed: 17026
% 5.63/5.83 # Tautologies deleted: 15
% 5.63/5.83 # Forward subsumed : 519
% 5.63/5.83 # Backward subsumed : 29
% 5.63/5.83 # -------- CPU Time ---------
% 5.63/5.83 # User time : 5.408 s
% 5.63/5.83 # System time : 0.039 s
% 5.63/5.83 # Total time : 5.447 s
%------------------------------------------------------------------------------