TSTP Solution File: SWC203+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC203+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n025.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 : 300s
% DateTime : Thu May 9 17:43:34 EDT 2024
% Result : Theorem 18.05s 18.23s
% Output : Refutation 18.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 83 ( 39 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 88 ( 29 ~; 23 |; 24 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn 12 !; 8 ?)
% 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) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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) ) ) ) ) ),
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) ) ) ) ) ),
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) ) ) ) ),
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) ) ) ) ),
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) ),
inference(skolemize,[status(esa)],[c26]) ).
cnf(c36,negated_conjecture,
~ neq(skolem0001,nil),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c32,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(transitivity,axiom,
( X254 != X255
| X255 != X253
| X254 = X253 ),
theory(equality) ).
cnf(c34,negated_conjecture,
skolem0004 = skolem0003,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c518,plain,
( X384 != skolem0004
| X384 = skolem0003 ),
inference(resolution,[status(thm)],[c34,transitivity]) ).
cnf(c730,plain,
skolem0002 = skolem0003,
inference(resolution,[status(thm)],[c518,c32]) ).
cnf(symmetry,axiom,
( X251 != X252
| X252 = X251 ),
theory(equality) ).
cnf(c33,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c516,plain,
skolem0003 = skolem0001,
inference(resolution,[status(thm)],[c33,symmetry]) ).
cnf(c531,plain,
( X398 != skolem0003
| X398 = skolem0001 ),
inference(resolution,[status(thm)],[c516,transitivity]) ).
cnf(c791,plain,
skolem0002 = skolem0001,
inference(resolution,[status(thm)],[c531,c730]) ).
cnf(reflexivity,axiom,
X250 = X250,
theory(equality) ).
cnf(c35,negated_conjecture,
neq(skolem0002,nil),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c5,axiom,
( X277 != X278
| X276 != X275
| ~ neq(X277,X276)
| neq(X278,X275) ),
theory(equality) ).
cnf(c565,plain,
( skolem0002 != X740
| nil != X741
| neq(X740,X741) ),
inference(resolution,[status(thm)],[c5,c35]) ).
cnf(c22761,plain,
( skolem0002 != X900
| neq(X900,nil) ),
inference(resolution,[status(thm)],[c565,reflexivity]) ).
cnf(c43574,plain,
neq(skolem0001,nil),
inference(resolution,[status(thm)],[c22761,c791]) ).
cnf(c43631,plain,
$false,
inference(resolution,[status(thm)],[c43574,c36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC203+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 9 03:03:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 18.05/18.23 % Version: 1.5
% 18.05/18.23 % SZS status Theorem
% 18.05/18.23 % SZS output start CNFRefutation
% See solution above
% 18.07/18.23
% 18.07/18.23 % Initial clauses : 225
% 18.07/18.23 % Processed clauses : 1271
% 18.07/18.23 % Factors computed : 51
% 18.07/18.23 % Resolvents computed: 43076
% 18.07/18.23 % Tautologies deleted: 18
% 18.07/18.23 % Forward subsumed : 836
% 18.07/18.23 % Backward subsumed : 0
% 18.07/18.23 % -------- CPU Time ---------
% 18.07/18.23 % User time : 17.766 s
% 18.07/18.23 % System time : 0.104 s
% 18.07/18.23 % Total time : 17.870 s
%------------------------------------------------------------------------------