TSTP Solution File: SWC333+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC333+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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:40:05 EDT 2023
% Result : Theorem 0.21s 0.37s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 183 ( 10 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 220 ( 85 ~; 79 |; 38 &)
% ( 8 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 23 (; 16 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
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
| ~ segmentP(X,W)
| ~ totalorderedP(W)
| ? [Y] :
( ssList(Y)
& neq(W,Y)
& segmentP(X,Y)
& segmentP(Y,W)
& totalorderedP(Y) )
| ( ! [Z] :
( ssList(Z)
=> ( ~ neq(U,Z)
| ~ segmentP(V,Z)
| ~ segmentP(Z,U)
| ~ totalorderedP(Z) ) )
& segmentP(V,U)
& totalorderedP(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
| ~ segmentP(X,W)
| ~ totalorderedP(W)
| ? [Y] :
( ssList(Y)
& neq(W,Y)
& segmentP(X,Y)
& segmentP(Y,W)
& totalorderedP(Y) )
| ( ! [Z] :
( ssList(Z)
=> ( ~ neq(U,Z)
| ~ segmentP(V,Z)
| ~ segmentP(Z,U)
| ~ totalorderedP(Z) ) )
& segmentP(V,U)
& totalorderedP(U) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& segmentP(X,W)
& totalorderedP(W)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(W,Y)
| ~ segmentP(X,Y)
| ~ segmentP(Y,W)
| ~ totalorderedP(Y) )
& ( ? [Z] :
( ssList(Z)
& neq(U,Z)
& segmentP(V,Z)
& segmentP(Z,U)
& totalorderedP(Z) )
| ~ segmentP(V,U)
| ~ totalorderedP(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
& segmentP(sk0_50,sk0_49)
& totalorderedP(sk0_49)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(sk0_49,Y)
| ~ segmentP(sk0_50,Y)
| ~ segmentP(Y,sk0_49)
| ~ totalorderedP(Y) )
& ( ( ssList(sk0_51)
& neq(sk0_47,sk0_51)
& segmentP(sk0_48,sk0_51)
& segmentP(sk0_51,sk0_47)
& totalorderedP(sk0_51) )
| ~ segmentP(sk0_48,sk0_47)
| ~ totalorderedP(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,
segmentP(sk0_50,sk0_49),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
totalorderedP(sk0_49),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk0_49,X0)
| ~ segmentP(sk0_50,X0)
| ~ segmentP(X0,sk0_49)
| ~ totalorderedP(X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( ssList(sk0_51)
| ~ segmentP(sk0_48,sk0_47)
| ~ totalorderedP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( neq(sk0_47,sk0_51)
| ~ segmentP(sk0_48,sk0_47)
| ~ totalorderedP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
( segmentP(sk0_48,sk0_51)
| ~ segmentP(sk0_48,sk0_47)
| ~ totalorderedP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
( segmentP(sk0_51,sk0_47)
| ~ segmentP(sk0_48,sk0_47)
| ~ totalorderedP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f430,plain,
( totalorderedP(sk0_51)
| ~ segmentP(sk0_48,sk0_47)
| ~ totalorderedP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f431,plain,
( spl0_0
<=> ssList(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f434,plain,
( spl0_1
<=> segmentP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( ~ segmentP(sk0_48,sk0_47)
| spl0_1 ),
inference(component_clause,[status(thm)],[f434]) ).
fof(f437,plain,
( spl0_2
<=> totalorderedP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f439,plain,
( ~ totalorderedP(sk0_47)
| spl0_2 ),
inference(component_clause,[status(thm)],[f437]) ).
fof(f440,plain,
( spl0_0
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f426,f431,f434,f437]) ).
fof(f441,plain,
( spl0_3
<=> neq(sk0_47,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f444,plain,
( spl0_3
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f427,f441,f434,f437]) ).
fof(f445,plain,
( spl0_4
<=> segmentP(sk0_48,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f446,plain,
( segmentP(sk0_48,sk0_51)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f445]) ).
fof(f448,plain,
( spl0_4
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f428,f445,f434,f437]) ).
fof(f449,plain,
( spl0_5
<=> segmentP(sk0_51,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f452,plain,
( spl0_5
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f429,f449,f434,f437]) ).
fof(f453,plain,
( spl0_6
<=> totalorderedP(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f456,plain,
( spl0_6
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f430,f453,f434,f437]) ).
fof(f489,plain,
totalorderedP(sk0_47),
inference(forward_demodulation,[status(thm)],[f422,f424]) ).
fof(f490,plain,
segmentP(sk0_48,sk0_49),
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f491,plain,
segmentP(sk0_48,sk0_47),
inference(forward_demodulation,[status(thm)],[f422,f490]) ).
fof(f492,plain,
( spl0_7
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f494,plain,
( ~ ssList(nil)
| spl0_7 ),
inference(component_clause,[status(thm)],[f492]) ).
fof(f502,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f439,f489]) ).
fof(f503,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f502]) ).
fof(f504,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f436,f491]) ).
fof(f505,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f504]) ).
fof(f506,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f494,f223]) ).
fof(f507,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f506]) ).
fof(f508,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk0_47,X0)
| ~ segmentP(sk0_50,X0)
| ~ segmentP(X0,sk0_49)
| ~ totalorderedP(X0) ),
inference(forward_demodulation,[status(thm)],[f422,f425]) ).
fof(f509,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk0_47,X0)
| ~ segmentP(sk0_48,X0)
| ~ segmentP(X0,sk0_49)
| ~ totalorderedP(X0) ),
inference(forward_demodulation,[status(thm)],[f421,f508]) ).
fof(f510,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(sk0_47,X0)
| ~ segmentP(sk0_48,X0)
| ~ segmentP(X0,sk0_47)
| ~ totalorderedP(X0) ),
inference(forward_demodulation,[status(thm)],[f422,f509]) ).
fof(f511,plain,
( ~ ssList(sk0_51)
| ~ neq(sk0_47,sk0_51)
| ~ segmentP(sk0_51,sk0_47)
| ~ totalorderedP(sk0_51)
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f510,f446]) ).
fof(f512,plain,
( ~ spl0_0
| ~ spl0_3
| ~ spl0_5
| ~ spl0_6
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f511,f431,f441,f449,f453,f445]) ).
fof(f560,plain,
$false,
inference(sat_refutation,[status(thm)],[f440,f444,f448,f452,f456,f503,f505,f507,f512]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC333+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n021.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:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.21/0.37 % Refutation found
% 0.21/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.27/0.58 % Elapsed time: 0.021951 seconds
% 0.27/0.58 % CPU time: 0.047687 seconds
% 0.27/0.58 % Memory used: 16.154 MB
%------------------------------------------------------------------------------