TSTP Solution File: SWC026+1 by PyRes---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SWC026+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n012.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:05 EDT 2024
% Result : Theorem 83.77s 83.98s
% Output : Refutation 83.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 123 ( 98 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 138 ( 43 ~; 40 |; 47 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity,axiom,
( X255 != X253
| X253 != X254
| X255 = X254 ),
theory(equality) ).
cnf(symmetry,axiom,
( X252 != X251
| X251 = X252 ),
theory(equality) ).
fof(co1,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ( nil != X
& nil = W )
| ( nil != W
& nil = X )
| ( ( nil != V
| nil = U )
& ( nil != U
| nil = V ) ) ) ) ) ) ),
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
| ( nil != X
& nil = W )
| ( nil != W
& nil = X )
| ( ( nil != V
| nil = U )
& ( nil != U
| nil = V ) ) ) ) ) ) ),
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
& ( nil = X
| nil != W )
& ( nil = W
| nil != X )
& ( ( nil = V
& nil != U )
| ( nil = U
& nil != V ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[c23]) ).
fof(c25,negated_conjecture,
? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& X3 = X5
& X2 = X4
& ( nil = X5
| nil != X4 )
& ( nil = X4
| nil != X5 )
& ( ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
inference(variable_rename,[status(thm)],[c24]) ).
fof(c26,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ( nil = skolem0004
| nil != skolem0003 )
& ( nil = skolem0003
| nil != skolem0004 )
& ( ( nil = skolem0002
& nil != skolem0001 )
| ( nil = skolem0001
& nil != skolem0002 ) ) ),
inference(skolemize,[status(esa)],[c25]) ).
fof(c27,negated_conjecture,
( ssList(skolem0001)
& ssList(skolem0002)
& ssList(skolem0003)
& ssList(skolem0004)
& skolem0002 = skolem0004
& skolem0001 = skolem0003
& ( nil = skolem0004
| nil != skolem0003 )
& ( nil = skolem0003
| nil != skolem0004 )
& ( nil = skolem0002
| nil = skolem0001 )
& ( nil = skolem0002
| nil != skolem0002 )
& ( nil != skolem0001
| nil = skolem0001 )
& ( nil != skolem0001
| nil != skolem0002 ) ),
inference(distribute,[status(thm)],[c26]) ).
cnf(c33,negated_conjecture,
skolem0001 = skolem0003,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c519,plain,
skolem0003 = skolem0001,
inference(resolution,[status(thm)],[c33,symmetry]) ).
cnf(c528,plain,
( X360 != skolem0003
| X360 = skolem0001 ),
inference(resolution,[status(thm)],[c519,transitivity]) ).
cnf(c35,negated_conjecture,
( nil = skolem0003
| nil != skolem0004 ),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c36,negated_conjecture,
( nil = skolem0002
| nil = skolem0001 ),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c32,negated_conjecture,
skolem0002 = skolem0004,
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c515,plain,
( X357 != skolem0002
| X357 = skolem0004 ),
inference(resolution,[status(thm)],[c32,transitivity]) ).
cnf(c705,plain,
( nil = skolem0004
| nil = skolem0001 ),
inference(resolution,[status(thm)],[c515,c36]) ).
cnf(c19903,plain,
( nil = skolem0001
| nil = skolem0003 ),
inference(resolution,[status(thm)],[c705,c35]) ).
cnf(c88782,plain,
nil = skolem0001,
inference(resolution,[status(thm)],[c19903,c528]) ).
cnf(c39,negated_conjecture,
( nil != skolem0001
| nil != skolem0002 ),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c516,plain,
skolem0004 = skolem0002,
inference(resolution,[status(thm)],[c32,symmetry]) ).
cnf(c524,plain,
( X359 != skolem0004
| X359 = skolem0002 ),
inference(resolution,[status(thm)],[c516,transitivity]) ).
cnf(c34,negated_conjecture,
( nil = skolem0004
| nil != skolem0003 ),
inference(split_conjunct,[status(thm)],[c27]) ).
cnf(c518,plain,
( X358 != skolem0001
| X358 = skolem0003 ),
inference(resolution,[status(thm)],[c33,transitivity]) ).
cnf(c88701,plain,
nil = skolem0003,
inference(resolution,[status(thm)],[c19903,c518]) ).
cnf(c88968,plain,
nil = skolem0004,
inference(resolution,[status(thm)],[c88701,c34]) ).
cnf(c89271,plain,
nil = skolem0002,
inference(resolution,[status(thm)],[c88968,c524]) ).
cnf(c89685,plain,
nil != skolem0001,
inference(resolution,[status(thm)],[c89271,c39]) ).
cnf(c89953,plain,
$false,
inference(resolution,[status(thm)],[c89685,c88782]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC026+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n012.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 : 300
% 0.13/0.34 % DateTime : Thu May 9 02:21:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 83.77/83.98 % Version: 1.5
% 83.77/83.98 % SZS status Theorem
% 83.77/83.98 % SZS output start CNFRefutation
% See solution above
% 83.77/83.99
% 83.77/83.99 % Initial clauses : 228
% 83.77/83.99 % Processed clauses : 2449
% 83.77/83.99 % Factors computed : 52
% 83.77/83.99 % Resolvents computed: 89393
% 83.77/83.99 % Tautologies deleted: 26
% 83.77/83.99 % Forward subsumed : 3097
% 83.77/83.99 % Backward subsumed : 950
% 83.77/83.99 % -------- CPU Time ---------
% 83.77/83.99 % User time : 83.384 s
% 83.77/83.99 % System time : 0.236 s
% 83.77/83.99 % Total time : 83.620 s
%------------------------------------------------------------------------------