TSTP Solution File: SWC206+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC206+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n005.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:40 EDT 2023
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 58 ( 11 unt; 0 def)
% Number of atoms : 184 ( 35 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 201 ( 75 ~; 71 |; 30 &)
% ( 12 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 27 (; 22 !; 5 ?)
% 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)
=> ( V != X
| U != W
| ~ neq(V,nil)
| neq(U,nil)
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssList(Y)
=> ( ~ neq(Y,nil)
| ~ segmentP(X,Y)
| ~ segmentP(W,Y) ) )
& neq(X,nil) ) ) ) ) ) ),
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
| ~ neq(V,nil)
| neq(U,nil)
| ( nil != W
& nil = X )
| ( ! [Y] :
( ssList(Y)
=> ( ~ neq(Y,nil)
| ~ segmentP(X,Y)
| ~ segmentP(W,Y) ) )
& neq(X,nil) ) ) ) ) ) ),
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(f220,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)
& V = X
& U = W
& neq(V,nil)
& ~ neq(U,nil)
& ( nil = W
| nil != X )
& ( ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(X,Y)
& segmentP(W,Y) )
| ~ neq(X,nil) ) ) ) ) ),
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
& neq(sk0_48,nil)
& ~ neq(sk0_47,nil)
& ( nil = sk0_49
| nil != sk0_50 )
& ( ( ssList(sk0_51)
& neq(sk0_51,nil)
& segmentP(sk0_50,sk0_51)
& segmentP(sk0_49,sk0_51) )
| ~ neq(sk0_50,nil) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f417,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f421,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f422,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f423,plain,
neq(sk0_48,nil),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
~ neq(sk0_47,nil),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( ssList(sk0_51)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( neq(sk0_51,nil)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
( segmentP(sk0_49,sk0_51)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f437,plain,
( spl0_2
<=> ssList(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f440,plain,
( spl0_3
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f442,plain,
( ~ neq(sk0_50,nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f440]) ).
fof(f443,plain,
( spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f426,f437,f440]) ).
fof(f444,plain,
( spl0_4
<=> neq(sk0_51,nil) ),
introduced(split_symbol_definition) ).
fof(f445,plain,
( neq(sk0_51,nil)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f444]) ).
fof(f447,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f427,f444,f440]) ).
fof(f452,plain,
( spl0_6
<=> segmentP(sk0_49,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f453,plain,
( segmentP(sk0_49,sk0_51)
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f452]) ).
fof(f455,plain,
( spl0_6
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f429,f452,f440]) ).
fof(f488,plain,
( spl0_7
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f490,plain,
( ~ ssList(nil)
| spl0_7 ),
inference(component_clause,[status(thm)],[f488]) ).
fof(f498,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f490,f223]) ).
fof(f499,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f498]) ).
fof(f506,plain,
( spl0_11
<=> sk0_47 = nil ),
introduced(split_symbol_definition) ).
fof(f507,plain,
( sk0_47 = nil
| ~ spl0_11 ),
inference(component_clause,[status(thm)],[f506]) ).
fof(f511,plain,
( spl0_12
<=> ssList(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f513,plain,
( ~ ssList(sk0_47)
| spl0_12 ),
inference(component_clause,[status(thm)],[f511]) ).
fof(f514,plain,
( ~ ssList(sk0_47)
| ~ ssList(nil)
| sk0_47 = nil ),
inference(resolution,[status(thm)],[f220,f424]) ).
fof(f515,plain,
( ~ spl0_12
| ~ spl0_7
| spl0_11 ),
inference(split_clause,[status(thm)],[f514,f511,f488,f506]) ).
fof(f516,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f513,f417]) ).
fof(f517,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f519,plain,
( ~ neq(nil,nil)
| ~ spl0_11 ),
inference(backward_demodulation,[status(thm)],[f507,f424]) ).
fof(f520,plain,
( nil = sk0_49
| ~ spl0_11 ),
inference(backward_demodulation,[status(thm)],[f507,f422]) ).
fof(f522,plain,
( ~ neq(sk0_48,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f421,f442]) ).
fof(f523,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f522,f423]) ).
fof(f524,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f523]) ).
fof(f526,plain,
( segmentP(nil,sk0_51)
| ~ spl0_11
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f520,f453]) ).
fof(f532,plain,
( spl0_13
<=> nil = sk0_51 ),
introduced(split_symbol_definition) ).
fof(f533,plain,
( nil = sk0_51
| ~ spl0_13 ),
inference(component_clause,[status(thm)],[f532]) ).
fof(f535,plain,
( ~ ssList(sk0_51)
| nil = sk0_51
| ~ spl0_11
| ~ spl0_6 ),
inference(resolution,[status(thm)],[f526,f326]) ).
fof(f536,plain,
( ~ spl0_2
| spl0_13
| ~ spl0_11
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f535,f437,f532,f506,f452]) ).
fof(f539,plain,
( neq(nil,nil)
| ~ spl0_13
| ~ spl0_4 ),
inference(backward_demodulation,[status(thm)],[f533,f445]) ).
fof(f540,plain,
( $false
| ~ spl0_11
| ~ spl0_13
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f539,f519]) ).
fof(f541,plain,
( ~ spl0_11
| ~ spl0_13
| ~ spl0_4 ),
inference(contradiction_clause,[status(thm)],[f540]) ).
fof(f542,plain,
$false,
inference(sat_refutation,[status(thm)],[f443,f447,f455,f499,f515,f517,f524,f536,f541]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC206+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n005.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:19:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 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.19/0.59 % Elapsed time: 0.025526 seconds
% 0.19/0.59 % CPU time: 0.048266 seconds
% 0.19/0.59 % Memory used: 16.142 MB
%------------------------------------------------------------------------------