TSTP Solution File: SWC050+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC050+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n023.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:19 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 74 ( 12 unt; 0 def)
% Number of atoms : 237 ( 12 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 257 ( 94 ~; 92 |; 49 &)
% ( 10 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 64 ( 51 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f51,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,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
| ( ( ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& rearsegP(V,Y)
& rearsegP(U,Y) )
| ! [Z] :
( ssList(Z)
=> ( ~ neq(Z,nil)
| ~ rearsegP(X,Z)
| ~ rearsegP(W,Z) ) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
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)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& rearsegP(V,Y)
& rearsegP(U,Y) )
| ! [Z] :
( ssList(Z)
=> ( ~ neq(Z,nil)
| ~ rearsegP(X,Z)
| ~ rearsegP(W,Z) ) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f308,plain,
! [U] :
( ~ ssList(U)
| rearsegP(U,nil) ),
inference(pre_NNF_transformation,[status(esa)],[f51]) ).
fof(f309,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,nil) ),
inference(cnf_transformation,[status(esa)],[f308]) ).
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)
| ~ rearsegP(V,Y)
| ~ rearsegP(U,Y) )
& ? [Z] :
( ssList(Z)
& neq(Z,nil)
& rearsegP(X,Z)
& rearsegP(W,Z) ) )
| ( neq(V,nil)
& ~ neq(X,nil) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [U,V,W,X] :
( pd0_0(X,W,V,U)
=> ( neq(V,nil)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(Y,nil)
| ~ rearsegP(V,Y)
| ~ rearsegP(U,Y) )
& ? [Z] :
( ssList(Z)
& neq(Z,nil)
& rearsegP(X,Z)
& rearsegP(W,Z) ) ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ( pd0_0(X,W,V,U)
| ( neq(V,nil)
& ~ neq(X,nil) ) ) ) ) ) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| ( neq(sk0_48,nil)
& ~ neq(sk0_50,nil) ) ) ),
inference(skolemization,[status(esa)],[f417]) ).
fof(f419,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f420,plain,
ssList(sk0_48),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f423,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f424,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f425,plain,
( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| neq(sk0_48,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f426,plain,
( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| ~ neq(sk0_50,nil) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f427,plain,
! [U,V,W,X] :
( ~ pd0_0(X,W,V,U)
| ( neq(V,nil)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(Y,nil)
| ~ rearsegP(V,Y)
| ~ rearsegP(U,Y) )
& ? [Z] :
( ssList(Z)
& neq(Z,nil)
& rearsegP(X,Z)
& rearsegP(W,Z) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
! [U,V,W,X] :
( ~ pd0_0(X,W,V,U)
| ( neq(V,nil)
& ! [Y] :
( ~ ssList(Y)
| ~ neq(Y,nil)
| ~ rearsegP(V,Y)
| ~ rearsegP(U,Y) )
& ssList(sk0_51(X,W,V,U))
& neq(sk0_51(X,W,V,U),nil)
& rearsegP(X,sk0_51(X,W,V,U))
& rearsegP(W,sk0_51(X,W,V,U)) ) ),
inference(skolemization,[status(esa)],[f427]) ).
fof(f430,plain,
! [X0,X1,X2,X3,X4] :
( ~ pd0_0(X0,X1,X2,X3)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(X2,X4)
| ~ rearsegP(X3,X4) ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f431,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| ssList(sk0_51(X0,X1,X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f432,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| neq(sk0_51(X0,X1,X2,X3),nil) ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f433,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| rearsegP(X0,sk0_51(X0,X1,X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f434,plain,
! [X0,X1,X2,X3] :
( ~ pd0_0(X0,X1,X2,X3)
| rearsegP(X1,sk0_51(X0,X1,X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f435,plain,
( spl0_0
<=> pd0_0(sk0_50,sk0_49,sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f436,plain,
( pd0_0(sk0_50,sk0_49,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f438,plain,
( spl0_1
<=> neq(sk0_48,nil) ),
introduced(split_symbol_definition) ).
fof(f439,plain,
( neq(sk0_48,nil)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f425,f435,f438]) ).
fof(f442,plain,
( spl0_2
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f444,plain,
( ~ neq(sk0_50,nil)
| spl0_2 ),
inference(component_clause,[status(thm)],[f442]) ).
fof(f445,plain,
( spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f426,f435,f442]) ).
fof(f482,plain,
rearsegP(sk0_48,nil),
inference(resolution,[status(thm)],[f309,f420]) ).
fof(f483,plain,
rearsegP(sk0_47,nil),
inference(resolution,[status(thm)],[f309,f419]) ).
fof(f491,plain,
( ~ neq(sk0_48,nil)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f423,f444]) ).
fof(f492,plain,
( pd0_0(sk0_48,sk0_49,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f436]) ).
fof(f493,plain,
( pd0_0(sk0_48,sk0_47,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f424,f492]) ).
fof(f497,plain,
( $false
| spl0_2
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f439,f491]) ).
fof(f498,plain,
( spl0_2
| ~ spl0_1 ),
inference(contradiction_clause,[status(thm)],[f497]) ).
fof(f500,plain,
( ssList(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f431,f493]) ).
fof(f504,plain,
( rearsegP(sk0_48,sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f433,f493]) ).
fof(f505,plain,
( rearsegP(sk0_47,sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f434,f493]) ).
fof(f506,plain,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ rearsegP(sk0_48,X0)
| ~ rearsegP(sk0_47,X0)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f430,f493]) ).
fof(f507,plain,
( spl0_3
<=> ssList(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f509,plain,
( ~ ssList(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| spl0_3 ),
inference(component_clause,[status(thm)],[f507]) ).
fof(f510,plain,
( spl0_4
<=> neq(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47),nil) ),
introduced(split_symbol_definition) ).
fof(f512,plain,
( ~ neq(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47),nil)
| spl0_4 ),
inference(component_clause,[status(thm)],[f510]) ).
fof(f513,plain,
( spl0_5
<=> rearsegP(sk0_47,sk0_51(sk0_48,sk0_47,sk0_48,sk0_47)) ),
introduced(split_symbol_definition) ).
fof(f515,plain,
( ~ rearsegP(sk0_47,sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| spl0_5 ),
inference(component_clause,[status(thm)],[f513]) ).
fof(f516,plain,
( ~ ssList(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| ~ neq(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47),nil)
| ~ rearsegP(sk0_47,sk0_51(sk0_48,sk0_47,sk0_48,sk0_47))
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f506,f504]) ).
fof(f517,plain,
( ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f516,f507,f510,f513,f435]) ).
fof(f518,plain,
( spl0_6
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f520,plain,
( ~ ssList(nil)
| spl0_6 ),
inference(component_clause,[status(thm)],[f518]) ).
fof(f521,plain,
( spl0_7
<=> neq(nil,nil) ),
introduced(split_symbol_definition) ).
fof(f524,plain,
( spl0_8
<=> rearsegP(sk0_47,nil) ),
introduced(split_symbol_definition) ).
fof(f526,plain,
( ~ rearsegP(sk0_47,nil)
| spl0_8 ),
inference(component_clause,[status(thm)],[f524]) ).
fof(f527,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ rearsegP(sk0_47,nil)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f506,f482]) ).
fof(f528,plain,
( ~ spl0_6
| ~ spl0_7
| ~ spl0_8
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f527,f518,f521,f524,f435]) ).
fof(f529,plain,
( spl0_9
<=> ssList(sk0_48) ),
introduced(split_symbol_definition) ).
fof(f531,plain,
( ~ ssList(sk0_48)
| spl0_9 ),
inference(component_clause,[status(thm)],[f529]) ).
fof(f537,plain,
( $false
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f531,f420]) ).
fof(f538,plain,
spl0_9,
inference(contradiction_clause,[status(thm)],[f537]) ).
fof(f539,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f526,f483]) ).
fof(f540,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f539]) ).
fof(f541,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f520,f223]) ).
fof(f542,plain,
spl0_6,
inference(contradiction_clause,[status(thm)],[f541]) ).
fof(f543,plain,
( $false
| ~ spl0_0
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f515,f505]) ).
fof(f544,plain,
( ~ spl0_0
| spl0_5 ),
inference(contradiction_clause,[status(thm)],[f543]) ).
fof(f545,plain,
( $false
| ~ spl0_0
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f509,f500]) ).
fof(f546,plain,
( ~ spl0_0
| spl0_3 ),
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f549,plain,
( neq(sk0_51(sk0_48,sk0_47,sk0_48,sk0_47),nil)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f432,f493]) ).
fof(f550,plain,
( $false
| spl0_4
| ~ spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f549,f512]) ).
fof(f551,plain,
( spl0_4
| ~ spl0_0 ),
inference(contradiction_clause,[status(thm)],[f550]) ).
fof(f552,plain,
$false,
inference(sat_refutation,[status(thm)],[f441,f445,f498,f517,f528,f538,f540,f542,f544,f546,f551]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC050+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 : n023.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 Apr 30 00:24:40 EDT 2024
% 0.13/0.34 % 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.39 % Elapsed time: 0.038023 seconds
% 0.13/0.39 % CPU time: 0.065736 seconds
% 0.13/0.39 % Total memory used: 14.719 MB
% 0.13/0.39 % Net memory used: 14.693 MB
%------------------------------------------------------------------------------