TSTP Solution File: SWC189+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC189+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:39:37 EDT 2023
% Result : Theorem 0.08s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 137 ( 34 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 148 ( 47 ~; 46 |; 34 &)
% ( 5 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 48 (; 32 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssItem(Z)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& Y != Z
& app(app(app(X1,cons(Y,nil)),cons(Z,nil)),X2) = W ) ) ) )
| ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(app(X5,cons(X3,nil)),cons(X4,nil)),X6) != U
| X3 = X4 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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] :
( ssItem(Z)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& Y != Z
& app(app(app(X1,cons(Y,nil)),cons(Z,nil)),X2) = W ) ) ) )
| ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(app(X5,cons(X3,nil)),cons(X4,nil)),X6) != U
| X3 = X4 ) ) ) ) ) ) ) ) ) ),
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] :
( ~ ssItem(Z)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| Y = Z
| app(app(app(X1,cons(Y,nil)),cons(Z,nil)),X2) != W ) ) ) )
& ? [X3] :
( ssItem(X3)
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(app(X5,cons(X3,nil)),cons(X4,nil)),X6) = U
& X3 != X4 ) ) ) ) ) ) ) ),
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] :
( ~ ssItem(Z)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| Y = Z
| app(app(app(X1,cons(Y,nil)),cons(Z,nil)),X2) != sk0_49 ) ) ) )
& ssItem(sk0_51)
& ssItem(sk0_52)
& ssList(sk0_53)
& ssList(sk0_54)
& app(app(app(sk0_53,cons(sk0_51,nil)),cons(sk0_52,nil)),sk0_54) = sk0_47
& sk0_51 != sk0_52 ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f422,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
! [X0,X1,X2,X3] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| X0 = X1
| app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sk0_49 ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
ssItem(sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
ssItem(sk0_52),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
ssList(sk0_53),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
ssList(sk0_54),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
app(app(app(sk0_53,cons(sk0_51,nil)),cons(sk0_52,nil)),sk0_54) = sk0_47,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
sk0_51 != sk0_52,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f481,plain,
! [X0,X1,X2,X3] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| X0 = X1
| app(app(app(X2,cons(X0,nil)),cons(X1,nil)),X3) != sk0_47 ),
inference(forward_demodulation,[status(thm)],[f422,f423]) ).
fof(f482,plain,
( spl0_4
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f484,plain,
( ~ ssItem(sk0_51)
| spl0_4 ),
inference(component_clause,[status(thm)],[f482]) ).
fof(f485,plain,
( spl0_5
<=> ssItem(sk0_52) ),
introduced(split_symbol_definition) ).
fof(f487,plain,
( ~ ssItem(sk0_52)
| spl0_5 ),
inference(component_clause,[status(thm)],[f485]) ).
fof(f488,plain,
( spl0_6
<=> ssList(sk0_53) ),
introduced(split_symbol_definition) ).
fof(f490,plain,
( ~ ssList(sk0_53)
| spl0_6 ),
inference(component_clause,[status(thm)],[f488]) ).
fof(f491,plain,
( spl0_7
<=> ssList(sk0_54) ),
introduced(split_symbol_definition) ).
fof(f493,plain,
( ~ ssList(sk0_54)
| spl0_7 ),
inference(component_clause,[status(thm)],[f491]) ).
fof(f494,plain,
( spl0_8
<=> sk0_51 = sk0_52 ),
introduced(split_symbol_definition) ).
fof(f495,plain,
( sk0_51 = sk0_52
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f494]) ).
fof(f497,plain,
( ~ ssItem(sk0_51)
| ~ ssItem(sk0_52)
| ~ ssList(sk0_53)
| ~ ssList(sk0_54)
| sk0_51 = sk0_52 ),
inference(resolution,[status(thm)],[f428,f481]) ).
fof(f498,plain,
( ~ spl0_4
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| spl0_8 ),
inference(split_clause,[status(thm)],[f497,f482,f485,f488,f491,f494]) ).
fof(f504,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f493,f427]) ).
fof(f505,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f504]) ).
fof(f506,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f490,f426]) ).
fof(f507,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f506]) ).
fof(f508,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f487,f425]) ).
fof(f509,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f508]) ).
fof(f510,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f484,f424]) ).
fof(f511,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f510]) ).
fof(f512,plain,
( $false
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f495,f429]) ).
fof(f513,plain,
~ spl0_8,
inference(contradiction_clause,[status(thm)],[f512]) ).
fof(f514,plain,
$false,
inference(sat_refutation,[status(thm)],[f498,f505,f507,f509,f511,f513]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC189+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue May 30 11:24:16 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.08/0.30 % Drodi V3.5.1
% 0.08/0.31 % Refutation found
% 0.08/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.52 % Elapsed time: 0.015210 seconds
% 0.14/0.52 % CPU time: 0.017268 seconds
% 0.14/0.52 % Memory used: 4.083 MB
%------------------------------------------------------------------------------