TSTP Solution File: SWC082+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC082+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:10 EDT 2023
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 5 unt; 0 def)
% Number of atoms : 138 ( 18 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 158 ( 56 ~; 52 |; 34 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 (; 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(V,Y)
& segmentP(U,Y) )
| ( nil != W
& nil = X )
| ( ! [Z] :
( ssList(Z)
=> ( ~ neq(Z,nil)
| ~ segmentP(X,Z)
| ~ segmentP(W,Z) ) )
& 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)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(V,Y)
& segmentP(U,Y) )
| ( nil != W
& nil = X )
| ( ! [Z] :
( ssList(Z)
=> ( ~ neq(Z,nil)
| ~ segmentP(X,Z)
| ~ segmentP(W,Z) ) )
& neq(X,nil) ) ) ) ) ) ),
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
& neq(V,nil)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(Y,nil)
| ~ segmentP(V,Y)
| ~ segmentP(U,Y) )
& ( nil = W
| nil != X )
& ( ? [Z] :
( ssList(Z)
& neq(Z,nil)
& segmentP(X,Z)
& segmentP(W,Z) )
| ~ 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)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(Y,nil)
| ~ segmentP(sk0_48,Y)
| ~ segmentP(sk0_47,Y) )
& ( 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(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,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk0_48,X0)
| ~ segmentP(sk0_47,X0) ),
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(f428,plain,
( segmentP(sk0_50,sk0_51)
| ~ 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(f447,plain,
( spl0_4
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f427,f444,f440]) ).
fof(f448,plain,
( spl0_5
<=> segmentP(sk0_50,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f449,plain,
( segmentP(sk0_50,sk0_51)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f448]) ).
fof(f451,plain,
( spl0_5
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f428,f448,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(f482,plain,
( ~ neq(sk0_48,nil)
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f421,f442]) ).
fof(f483,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f423]) ).
fof(f484,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f483]) ).
fof(f485,plain,
( segmentP(sk0_48,sk0_51)
| ~ spl0_5 ),
inference(forward_demodulation,[status(thm)],[f421,f449]) ).
fof(f486,plain,
( segmentP(sk0_47,sk0_51)
| ~ spl0_6 ),
inference(forward_demodulation,[status(thm)],[f422,f453]) ).
fof(f490,plain,
( spl0_7
<=> segmentP(sk0_47,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f492,plain,
( ~ segmentP(sk0_47,sk0_51)
| spl0_7 ),
inference(component_clause,[status(thm)],[f490]) ).
fof(f493,plain,
( ~ ssList(sk0_51)
| ~ neq(sk0_51,nil)
| ~ segmentP(sk0_47,sk0_51)
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f424,f485]) ).
fof(f494,plain,
( ~ spl0_2
| ~ spl0_4
| ~ spl0_7
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f493,f437,f444,f490,f448]) ).
fof(f538,plain,
( $false
| ~ spl0_6
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f492,f486]) ).
fof(f539,plain,
( ~ spl0_6
| spl0_7 ),
inference(contradiction_clause,[status(thm)],[f538]) ).
fof(f540,plain,
$false,
inference(sat_refutation,[status(thm)],[f443,f447,f451,f455,f484,f494,f539]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC082+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n024.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:22:03 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39 % Elapsed time: 0.042870 seconds
% 0.13/0.39 % CPU time: 0.146515 seconds
% 0.13/0.39 % Memory used: 22.458 MB
%------------------------------------------------------------------------------