TSTP Solution File: SWC121+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC121+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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:20 EDT 2023
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 6 unt; 0 def)
% Number of atoms : 174 ( 19 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 182 ( 64 ~; 63 |; 35 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 43 (; 35 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f57,axiom,
! [U] :
( ssList(U)
=> segmentP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f58,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> nil = U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ( ( ~ neq(V,nil)
| ~ neq(W,nil)
| ~ segmentP(X,W)
| ( neq(U,nil)
& segmentP(V,U) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
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
| ( ( ~ neq(V,nil)
| ~ neq(W,nil)
| ~ segmentP(X,W)
| ( neq(U,nil)
& segmentP(V,U) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f322,plain,
! [U] :
( ~ ssList(U)
| segmentP(U,nil) ),
inference(pre_NNF_transformation,[status(esa)],[f57]) ).
fof(f323,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f322]) ).
fof(f324,plain,
! [U] :
( ~ ssList(U)
| ( segmentP(nil,U)
<=> nil = U ) ),
inference(pre_NNF_transformation,[status(esa)],[f58]) ).
fof(f325,plain,
! [U] :
( ~ ssList(U)
| ( ( ~ segmentP(nil,U)
| nil = U )
& ( segmentP(nil,U)
| nil != U ) ) ),
inference(NNF_transformation,[status(esa)],[f324]) ).
fof(f326,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f325]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( ( neq(V,nil)
& neq(W,nil)
& segmentP(X,W)
& ( ~ neq(U,nil)
| ~ segmentP(V,U) ) )
| ( neq(V,nil)
& ~ neq(X,nil) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [U,V,W,X] :
( pd0_0(X,W,V,U)
=> ( neq(V,nil)
& neq(W,nil)
& segmentP(X,W)
& ( ~ neq(U,nil)
| ~ segmentP(V,U) ) ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( pd0_0(X,W,V,U)
| ( neq(V,nil)
& ~ neq(X,nil) ) ) ) ) ) ),
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
& ( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| ( neq(sk0_48,nil)
& ~ neq(sk0_50,nil) ) ) ),
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,
( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| neq(sk0_48,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f426,plain,
( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f427,plain,
! [U,V,W,X] :
( ~ pd0_0(X,W,V,U)
| ( neq(V,nil)
& neq(W,nil)
& segmentP(X,W)
& ( ~ neq(U,nil)
| ~ segmentP(V,U) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| neq(X1,nil) ),
inference(cnf_transformation,[status(esa)],[f427]) ).
fof(f430,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| segmentP(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f427]) ).
fof(f431,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| ~ neq(X3,nil)
| ~ segmentP(X2,X3) ),
inference(cnf_transformation,[status(esa)],[f427]) ).
fof(f432,plain,
( spl0_0
<=> pd0_0(sk0_50,sk0_49,sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f433,plain,
( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f432]) ).
fof(f435,plain,
( spl0_1
<=> neq(sk0_48,nil) ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( neq(sk0_48,nil)
| ~ 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_2
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f441,plain,
( ~ neq(sk0_50,nil)
| spl0_2 ),
inference(component_clause,[status(thm)],[f439]) ).
fof(f442,plain,
( spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f426,f432,f439]) ).
fof(f475,plain,
( spl0_3
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f477,plain,
( ~ ssList(nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f475]) ).
fof(f478,plain,
( spl0_4
<=> nil = nil ),
introduced(split_symbol_definition) ).
fof(f481,plain,
( ~ ssList(nil)
| nil = nil
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f326,f323]) ).
fof(f482,plain,
( ~ spl0_3
| spl0_4 ),
inference(split_clause,[status(thm)],[f481,f475,f478]) ).
fof(f485,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f477,f223]) ).
fof(f486,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f485]) ).
fof(f487,plain,
( ~ neq(sk0_48,nil)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f423,f441]) ).
fof(f499,plain,
( pd0_0(sk0_48,sk0_49,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f433]) ).
fof(f500,plain,
( pd0_0(sk0_48,sk0_47,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f424,f499]) ).
fof(f501,plain,
( neq(sk0_47,nil)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f500,f429]) ).
fof(f503,plain,
( segmentP(sk0_48,sk0_47)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f500,f430]) ).
fof(f504,plain,
( spl0_8
<=> neq(sk0_47,nil) ),
introduced(split_symbol_definition) ).
fof(f506,plain,
( ~ neq(sk0_47,nil)
| spl0_8 ),
inference(component_clause,[status(thm)],[f504]) ).
fof(f507,plain,
( spl0_9
<=> segmentP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f509,plain,
( ~ segmentP(sk0_48,sk0_47)
| spl0_9 ),
inference(component_clause,[status(thm)],[f507]) ).
fof(f510,plain,
( ~ neq(sk0_47,nil)
| ~ segmentP(sk0_48,sk0_47)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f431,f500]) ).
fof(f511,plain,
( ~ spl0_8
| ~ spl0_9
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f510,f504,f507,f432]) ).
fof(f512,plain,
( $false
| ~ spl0_0
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f506,f501]) ).
fof(f513,plain,
( ~ spl0_0
| spl0_8 ),
inference(contradiction_clause,[status(thm)],[f512]) ).
fof(f516,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f487,f436]) ).
fof(f517,plain,
( ~ spl0_1
| spl0_2 ),
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f519,plain,
( $false
| spl0_9
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f503,f509]) ).
fof(f520,plain,
( spl0_9
| ~ spl0_0 ),
inference(contradiction_clause,[status(thm)],[f519]) ).
fof(f521,plain,
$false,
inference(sat_refutation,[status(thm)],[f438,f442,f482,f486,f511,f513,f517,f520]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC121+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue May 30 11:21:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.37 % Drodi V3.5.1
% 0.20/0.38 % Refutation found
% 0.20/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/0.65 % Elapsed time: 0.080711 seconds
% 0.23/0.65 % CPU time: 0.038348 seconds
% 0.23/0.65 % Memory used: 4.075 MB
%------------------------------------------------------------------------------