TSTP Solution File: SWC026+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC026+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n032.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 : Wed May 31 12:38:56 EDT 2023
% Result : Theorem 0.14s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 4 unt; 0 def)
% Number of atoms : 157 ( 75 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 170 ( 61 ~; 59 |; 36 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 (; 17 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,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') ).
fof(f97,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(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [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(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [U,V] :
( pd0_0(V,U)
=> ( nil = V
& nil != U ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( nil = X
| nil != W )
& ( nil = W
| nil != X )
& ( pd0_0(V,U)
| ( nil = U
& nil != V ) ) ) ) ) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ( nil = sk0_50
| nil != sk0_49 )
& ( nil = sk0_49
| nil != sk0_50 )
& ( pd0_0(sk0_48,sk0_47)
| ( nil = sk0_47
& nil != sk0_48 ) ) ),
inference(skolemization,[status(esa)],[f417]) ).
fof(f423,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f424,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f425,plain,
( nil = sk0_50
| nil != sk0_49 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f426,plain,
( nil = sk0_49
| nil != sk0_50 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f427,plain,
( pd0_0(sk0_48,sk0_47)
| nil = sk0_47 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f428,plain,
( pd0_0(sk0_48,sk0_47)
| nil != sk0_48 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f429,plain,
! [U,V] :
( ~ pd0_0(V,U)
| ( nil = V
& nil != U ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f430,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f431,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| nil != X1 ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f432,plain,
( spl0_0
<=> nil = sk0_50 ),
introduced(split_symbol_definition) ).
fof(f433,plain,
( nil = sk0_50
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f432]) ).
fof(f434,plain,
( nil != sk0_50
| spl0_0 ),
inference(component_clause,[status(thm)],[f432]) ).
fof(f435,plain,
( spl0_1
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( nil = sk0_49
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f437,plain,
( nil != sk0_49
| spl0_1 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f438,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f425,f432,f435]) ).
fof(f439,plain,
( spl0_1
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f426,f435,f432]) ).
fof(f440,plain,
( spl0_2
<=> pd0_0(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f441,plain,
( pd0_0(sk0_48,sk0_47)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f440]) ).
fof(f443,plain,
( spl0_3
<=> nil = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f444,plain,
( nil = sk0_47
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f443]) ).
fof(f446,plain,
( spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f427,f440,f443]) ).
fof(f447,plain,
( spl0_4
<=> nil = sk0_48 ),
introduced(split_symbol_definition) ).
fof(f449,plain,
( nil != sk0_48
| spl0_4 ),
inference(component_clause,[status(thm)],[f447]) ).
fof(f450,plain,
( spl0_2
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f428,f440,f447]) ).
fof(f481,plain,
! [X0] : ~ pd0_0(X0,nil),
inference(destructive_equality_resolution,[status(esa)],[f431]) ).
fof(f484,plain,
( nil = sk0_47
| ~ spl0_1 ),
inference(forward_demodulation,[status(thm)],[f424,f436]) ).
fof(f487,plain,
( nil = sk0_48
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f433]) ).
fof(f488,plain,
( $false
| spl0_4
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f487,f449]) ).
fof(f489,plain,
( spl0_4
| ~ spl0_0 ),
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f490,plain,
( nil != sk0_48
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f434]) ).
fof(f491,plain,
( nil = sk0_48
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f441,f430]) ).
fof(f492,plain,
( $false
| spl0_0
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f491,f490]) ).
fof(f493,plain,
( spl0_0
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f492]) ).
fof(f495,plain,
( nil = sk0_49
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f444,f424]) ).
fof(f496,plain,
( $false
| spl0_1
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f495,f437]) ).
fof(f497,plain,
( spl0_1
| ~ spl0_3 ),
inference(contradiction_clause,[status(thm)],[f496]) ).
fof(f500,plain,
( pd0_0(nil,sk0_47)
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f491,f441]) ).
fof(f501,plain,
( pd0_0(nil,nil)
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f484,f500]) ).
fof(f502,plain,
( $false
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f501,f481]) ).
fof(f503,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(contradiction_clause,[status(thm)],[f502]) ).
fof(f504,plain,
$false,
inference(sat_refutation,[status(thm)],[f438,f439,f446,f450,f489,f493,f497,f503]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SWC026+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue May 30 11:22:31 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.5.1
% 0.14/0.31 % Refutation found
% 0.14/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.53 % Elapsed time: 0.018202 seconds
% 0.14/0.53 % CPU time: 0.017905 seconds
% 0.14/0.53 % Memory used: 4.065 MB
%------------------------------------------------------------------------------