TSTP Solution File: SWC385+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC385+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 : Tue Apr 30 20:45:36 EDT 2024
% Result : Theorem 0.10s 0.27s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 94 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 94 ( 31 ~; 29 |; 22 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ neq(V,nil)
| ~ segmentP(X,W)
| ( ~ singletonP(W)
& neq(X,nil) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
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)
| ~ segmentP(X,W)
| ( ~ singletonP(W)
& neq(X,nil) )
| ( singletonP(U)
& segmentP(V,U) ) ) ) ) ) ),
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)
& segmentP(X,W)
& ( singletonP(W)
| ~ neq(X,nil) )
& ( ~ singletonP(U)
| ~ segmentP(V,U) ) ) ) ) ),
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)
& segmentP(sk0_50,sk0_49)
& ( singletonP(sk0_49)
| ~ neq(sk0_50,nil) )
& ( ~ singletonP(sk0_47)
| ~ segmentP(sk0_48,sk0_47) ) ),
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,
segmentP(sk0_50,sk0_49),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
( singletonP(sk0_49)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( ~ singletonP(sk0_47)
| ~ segmentP(sk0_48,sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( spl0_0
<=> singletonP(sk0_49) ),
introduced(split_symbol_definition) ).
fof(f428,plain,
( singletonP(sk0_49)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f427]) ).
fof(f430,plain,
( spl0_1
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f432,plain,
( ~ neq(sk0_50,nil)
| spl0_1 ),
inference(component_clause,[status(thm)],[f430]) ).
fof(f433,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f425,f427,f430]) ).
fof(f434,plain,
( spl0_2
<=> singletonP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( ~ singletonP(sk0_47)
| spl0_2 ),
inference(component_clause,[status(thm)],[f434]) ).
fof(f437,plain,
( spl0_3
<=> segmentP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f439,plain,
( ~ segmentP(sk0_48,sk0_47)
| spl0_3 ),
inference(component_clause,[status(thm)],[f437]) ).
fof(f440,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f426,f434,f437]) ).
fof(f473,plain,
segmentP(sk0_48,sk0_49),
inference(forward_demodulation,[status(thm)],[f421,f424]) ).
fof(f474,plain,
segmentP(sk0_48,sk0_47),
inference(forward_demodulation,[status(thm)],[f422,f473]) ).
fof(f487,plain,
( ~ neq(sk0_48,nil)
| spl0_1 ),
inference(forward_demodulation,[status(thm)],[f421,f432]) ).
fof(f488,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f487,f423]) ).
fof(f489,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f490,plain,
( singletonP(sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f422,f428]) ).
fof(f491,plain,
( $false
| spl0_2
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f490,f436]) ).
fof(f492,plain,
( spl0_2
| ~ spl0_0 ),
inference(contradiction_clause,[status(thm)],[f491]) ).
fof(f494,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f439,f474]) ).
fof(f495,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f494]) ).
fof(f496,plain,
$false,
inference(sat_refutation,[status(thm)],[f433,f440,f489,f492,f495]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : SWC385+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.25 % Computer : n011.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue Apr 30 00:13:01 EDT 2024
% 0.06/0.25 % CPUTime :
% 0.06/0.26 % Drodi V3.6.0
% 0.10/0.27 % Refutation found
% 0.10/0.27 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.27 % Elapsed time: 0.015156 seconds
% 0.10/0.27 % CPU time: 0.021640 seconds
% 0.10/0.27 % Total memory used: 12.489 MB
% 0.10/0.27 % Net memory used: 12.467 MB
%------------------------------------------------------------------------------