TSTP Solution File: SWC037+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC037+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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 : Tue Apr 30 20:44:16 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 57 ( 10 unt; 0 def)
% Number of atoms : 187 ( 52 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 205 ( 75 ~; 67 |; 40 &)
% ( 9 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 49 ( 39 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f58,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> nil = U ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| nil = U
| ( ! [Y] :
( ssList(Y)
=> ( ~ neq(Y,nil)
| ~ segmentP(X,Y)
| ~ segmentP(W,Y) ) )
& ( nil != X
| nil != W ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| nil = U
| ( ! [Y] :
( ssList(Y)
=> ( ~ neq(Y,nil)
| ~ segmentP(X,Y)
| ~ segmentP(W,Y) ) )
& ( nil != X
| nil != W ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f217,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( neq(U,V)
<=> U != V ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f15]) ).
fof(f218,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ neq(U,V)
| U != V )
& ( neq(U,V)
| U = V ) ) ) ),
inference(NNF_transformation,[status(esa)],[f217]) ).
fof(f219,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f218]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
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)
& nil = V
& V = X
& U = W
& nil != U
& ( ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(X,Y)
& segmentP(W,Y) )
| ( nil = X
& nil = W ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [W,X,Y] :
( pd0_0(Y,X,W)
=> ( ssList(Y)
& neq(Y,nil)
& segmentP(X,Y)
& segmentP(W,Y) ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = V
& V = X
& U = W
& nil != U
& ( ? [Y] : pd0_0(Y,X,W)
| ( nil = X
& nil = W ) ) ) ) ) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& nil = sk0_48
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& nil != sk0_47
& ( pd0_0(sk0_51,sk0_50,sk0_49)
| ( nil = sk0_50
& nil = sk0_49 ) ) ),
inference(skolemization,[status(esa)],[f417]) ).
fof(f423,plain,
nil = sk0_48,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f424,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f425,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f426,plain,
nil != sk0_47,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f428,plain,
( pd0_0(sk0_51,sk0_50,sk0_49)
| nil = sk0_49 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f429,plain,
! [W,X,Y] :
( ~ pd0_0(Y,X,W)
| ( ssList(Y)
& neq(Y,nil)
& segmentP(X,Y)
& segmentP(W,Y) ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f430,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f431,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| neq(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f432,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| segmentP(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f434,plain,
( spl0_0
<=> pd0_0(sk0_51,sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f435,plain,
( pd0_0(sk0_51,sk0_50,sk0_49)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f434]) ).
fof(f441,plain,
( spl0_2
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f442,plain,
( nil = sk0_49
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,plain,
( spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f428,f434,f441]) ).
fof(f460,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(destructive_equality_resolution,[status(esa)],[f219]) ).
fof(f461,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(duplicate_literals_removal,[status(esa)],[f460]) ).
fof(f476,plain,
nil = sk0_50,
inference(forward_demodulation,[status(thm)],[f423,f424]) ).
fof(f479,plain,
( pd0_0(sk0_51,nil,sk0_49)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f476,f435]) ).
fof(f480,plain,
( pd0_0(sk0_51,nil,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f425,f479]) ).
fof(f481,plain,
( ssList(sk0_51)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f480,f430]) ).
fof(f482,plain,
( segmentP(nil,sk0_51)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f432,f480]) ).
fof(f484,plain,
( neq(sk0_51,nil)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f431,f480]) ).
fof(f485,plain,
( spl0_3
<=> ssList(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f487,plain,
( ~ ssList(sk0_51)
| spl0_3 ),
inference(component_clause,[status(thm)],[f485]) ).
fof(f488,plain,
( spl0_4
<=> nil = sk0_51 ),
introduced(split_symbol_definition) ).
fof(f489,plain,
( nil = sk0_51
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f488]) ).
fof(f491,plain,
( ~ ssList(sk0_51)
| nil = sk0_51
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f326,f482]) ).
fof(f492,plain,
( ~ spl0_3
| spl0_4
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f491,f485,f488,f434]) ).
fof(f493,plain,
( spl0_5
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f495,plain,
( ~ ssList(nil)
| spl0_5 ),
inference(component_clause,[status(thm)],[f493]) ).
fof(f503,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f495,f223]) ).
fof(f504,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f503]) ).
fof(f505,plain,
( $false
| ~ spl0_0
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f487,f481]) ).
fof(f506,plain,
( ~ spl0_0
| spl0_3 ),
inference(contradiction_clause,[status(thm)],[f505]) ).
fof(f507,plain,
( nil = sk0_47
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f425,f442]) ).
fof(f508,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f507,f426]) ).
fof(f509,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f508]) ).
fof(f517,plain,
( neq(nil,nil)
| ~ spl0_4
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f489,f484]) ).
fof(f518,plain,
( ~ ssList(nil)
| ~ spl0_4
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f517,f461]) ).
fof(f519,plain,
( ~ spl0_5
| ~ spl0_4
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f518,f493,f488,f434]) ).
fof(f521,plain,
$false,
inference(sat_refutation,[status(thm)],[f444,f492,f504,f506,f509,f519]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC037+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n007.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 : Mon Apr 29 23:52:32 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.13/0.37 % Refutation found
% 0.13/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.027854 seconds
% 0.13/0.38 % CPU time: 0.043973 seconds
% 0.13/0.38 % Total memory used: 14.614 MB
% 0.13/0.38 % Net memory used: 14.587 MB
%------------------------------------------------------------------------------