TSTP Solution File: SWC185+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC185+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %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 : Wed May 31 12:39:36 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 143 ( 22 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 171 ( 62 ~; 56 |; 34 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 45 (; 32 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& app(app(Z,cons(Y,nil)),X1) = W
& ( memberP(Z,Y)
| memberP(X1,Y) ) ) ) )
| ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(app(X3,cons(X2,nil)),X4) != U
| ( ~ memberP(X3,X2)
& ~ memberP(X4,X2) ) ) ) ) ) ) ) ) ) ),
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
| ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& app(app(Z,cons(Y,nil)),X1) = W
& ( memberP(Z,Y)
| memberP(X1,Y) ) ) ) )
| ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(app(X3,cons(X2,nil)),X4) != U
| ( ~ memberP(X3,X2)
& ~ memberP(X4,X2) ) ) ) ) ) ) ) ) ) ),
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
& ! [Y] :
( ~ ssItem(Y)
| ! [Z] :
( ~ ssList(Z)
| ! [X1] :
( ~ ssList(X1)
| app(app(Z,cons(Y,nil)),X1) != W
| ( ~ memberP(Z,Y)
& ~ memberP(X1,Y) ) ) ) )
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,cons(X2,nil)),X4) = U
& ( memberP(X3,X2)
| memberP(X4,X2) ) ) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ! [Y] :
( ~ ssItem(Y)
| ! [Z] :
( ~ ssList(Z)
| ! [X1] :
( ~ ssList(X1)
| app(app(Z,cons(Y,nil)),X1) != sk0_49
| ( ~ memberP(Z,Y)
& ~ memberP(X1,Y) ) ) ) )
& ssItem(sk0_51)
& ssList(sk0_52)
& ssList(sk0_53)
& app(app(sk0_52,cons(sk0_51,nil)),sk0_53) = sk0_47
& ( memberP(sk0_52,sk0_51)
| memberP(sk0_53,sk0_51) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f422,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
! [X0,X1,X2] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk0_49
| ~ memberP(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
! [X0,X1,X2] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk0_49
| ~ memberP(X2,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
ssItem(sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
ssList(sk0_52),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
ssList(sk0_53),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
app(app(sk0_52,cons(sk0_51,nil)),sk0_53) = sk0_47,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
( memberP(sk0_52,sk0_51)
| memberP(sk0_53,sk0_51) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f430,plain,
( spl0_0
<=> memberP(sk0_52,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f433,plain,
( spl0_1
<=> memberP(sk0_53,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f429,f430,f433]) ).
fof(f480,plain,
! [X0,X1,X2] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk0_47
| ~ memberP(X1,X0) ),
inference(forward_demodulation,[status(thm)],[f422,f423]) ).
fof(f481,plain,
( spl0_4
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f483,plain,
( ~ ssItem(sk0_51)
| spl0_4 ),
inference(component_clause,[status(thm)],[f481]) ).
fof(f484,plain,
( spl0_5
<=> ssList(sk0_52) ),
introduced(split_symbol_definition) ).
fof(f486,plain,
( ~ ssList(sk0_52)
| spl0_5 ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f487,plain,
( spl0_6
<=> ssList(sk0_53) ),
introduced(split_symbol_definition) ).
fof(f489,plain,
( ~ ssList(sk0_53)
| spl0_6 ),
inference(component_clause,[status(thm)],[f487]) ).
fof(f490,plain,
( ~ ssItem(sk0_51)
| ~ ssList(sk0_52)
| ~ ssList(sk0_53)
| ~ memberP(sk0_52,sk0_51) ),
inference(resolution,[status(thm)],[f428,f480]) ).
fof(f491,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f490,f481,f484,f487,f430]) ).
fof(f497,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f489,f427]) ).
fof(f498,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f497]) ).
fof(f499,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f426]) ).
fof(f500,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f499]) ).
fof(f501,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f483,f425]) ).
fof(f502,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f501]) ).
fof(f503,plain,
! [X0,X1,X2] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk0_47
| ~ memberP(X2,X0) ),
inference(forward_demodulation,[status(thm)],[f422,f424]) ).
fof(f504,plain,
( ~ ssItem(sk0_51)
| ~ ssList(sk0_52)
| ~ ssList(sk0_53)
| ~ memberP(sk0_53,sk0_51) ),
inference(resolution,[status(thm)],[f503,f428]) ).
fof(f505,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f504,f481,f484,f487,f433]) ).
fof(f508,plain,
$false,
inference(sat_refutation,[status(thm)],[f436,f491,f498,f500,f502,f505]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC185+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n025.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 : Tue May 30 11:31:42 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.030306 seconds
% 0.13/0.38 % CPU time: 0.049474 seconds
% 0.13/0.38 % Memory used: 16.161 MB
%------------------------------------------------------------------------------