TSTP Solution File: SWC391+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC391+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n004.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:44:00 EDT 2024
% Result : Theorem 16.84s 17.04s
% Output : Refutation 16.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 90 ( 40 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 94 ( 29 ~; 23 |; 27 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 15 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| X != W
| ! [Y] :
( ssItem(Y)
=> ( ~ memberP(U,Y)
| memberP(V,Y) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/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
| ! [Y] :
( ssItem(Y)
=> ( ~ memberP(U,Y)
| memberP(V,Y) ) ) ) ) ) ) ),
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
| ! [Y] :
( ssItem(Y)
=> ( ~ memberP(U,Y)
| memberP(V,Y) ) ) ) ) ) ) ),
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
& ? [Y] :
( ssItem(Y)
& memberP(U,Y)
& ~ memberP(V,Y) ) ) ) ) ),
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
& ? [X6] :
( ssItem(X6)
& memberP(X2,X6)
& ~ memberP(X3,X6) ) ) ) ) ),
inference(variable_rename,[status(thm)],[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& skolem0004 = skolem0003
& ssItem(skolem0005)
& memberP(skolem0001,skolem0005)
& ~ memberP(skolem0002,skolem0005) ),
inference(skolemize,[status(esa)],[c26]) ).
cnf(c37,negated_conjecture,
~ memberP(skolem0002,skolem0005),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(symmetry,axiom,
( X252 != X253
| X253 = X252 ),
theory(equality) ).
cnf(c32,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(transitivity,axiom,
( X254 != X255
| X255 != X256
| X254 = X256 ),
theory(equality) ).
cnf(c34,negated_conjecture,
skolem0004 = skolem0003,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c525,plain,
( X388 != skolem0004
| X388 = skolem0003 ),
inference(resolution,[status(thm)],[c34,transitivity]) ).
cnf(c754,plain,
skolem0002 = skolem0003,
inference(resolution,[status(thm)],[c525,c32]) ).
cnf(c33,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c516,plain,
skolem0003 = skolem0001,
inference(resolution,[status(thm)],[c33,symmetry]) ).
cnf(c539,plain,
( X407 != skolem0003
| X407 = skolem0001 ),
inference(resolution,[status(thm)],[c516,transitivity]) ).
cnf(c897,plain,
skolem0002 = skolem0001,
inference(resolution,[status(thm)],[c539,c754]) ).
cnf(c925,plain,
skolem0001 = skolem0002,
inference(resolution,[status(thm)],[c897,symmetry]) ).
cnf(reflexivity,axiom,
X251 = X251,
theory(equality) ).
cnf(c36,negated_conjecture,
memberP(skolem0001,skolem0005),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c7,axiom,
( X288 != X285
| X286 != X287
| ~ memberP(X288,X286)
| memberP(X285,X287) ),
theory(equality) ).
cnf(c584,plain,
( skolem0001 != X743
| skolem0005 != X742
| memberP(X743,X742) ),
inference(resolution,[status(thm)],[c7,c36]) ).
cnf(c22365,plain,
( skolem0001 != X904
| memberP(X904,skolem0005) ),
inference(resolution,[status(thm)],[c584,reflexivity]) ).
cnf(c41405,plain,
memberP(skolem0002,skolem0005),
inference(resolution,[status(thm)],[c22365,c925]) ).
cnf(c41414,plain,
$false,
inference(resolution,[status(thm)],[c41405,c37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC391+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.35 % Computer : n004.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:00:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 16.84/17.04 % Version: 1.5
% 16.84/17.04 % SZS status Theorem
% 16.84/17.04 % SZS output start CNFRefutation
% See solution above
% 16.84/17.04
% 16.84/17.04 % Initial clauses : 226
% 16.84/17.04 % Processed clauses : 1301
% 16.84/17.04 % Factors computed : 53
% 16.84/17.04 % Resolvents computed: 40864
% 16.84/17.04 % Tautologies deleted: 19
% 16.84/17.04 % Forward subsumed : 798
% 16.84/17.04 % Backward subsumed : 0
% 16.84/17.04 % -------- CPU Time ---------
% 16.84/17.04 % User time : 16.576 s
% 16.84/17.04 % System time : 0.104 s
% 16.84/17.04 % Total time : 16.680 s
%------------------------------------------------------------------------------