TSTP Solution File: SWC367+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC367+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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:13 EDT 2023
% Result : Theorem 0.14s 0.33s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 117 ( 26 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 118 ( 41 ~; 35 |; 29 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 27 (; 19 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f51,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,nil) ),
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
| rearsegP(V,U)
| ( ( nil != X
| nil != W )
& ( ~ neq(W,nil)
| ~ rearsegP(X,W) ) ) ) ) ) ) ),
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
| rearsegP(V,U)
| ( ( nil != X
| nil != W )
& ( ~ neq(W,nil)
| ~ rearsegP(X,W) ) ) ) ) ) ) ),
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
& ~ rearsegP(V,U)
& ( ( nil = X
& nil = W )
| ( neq(W,nil)
& rearsegP(X,W) ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [W,X] :
( pd0_0(X,W)
=> ( nil = X
& nil = W ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ rearsegP(V,U)
& ( pd0_0(X,W)
| ( neq(W,nil)
& rearsegP(X,W) ) ) ) ) ) ),
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
& ~ rearsegP(sk0_48,sk0_47)
& ( pd0_0(sk0_50,sk0_49)
| ( neq(sk0_49,nil)
& rearsegP(sk0_50,sk0_49) ) ) ),
inference(skolemization,[status(esa)],[f417]) ).
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,
~ rearsegP(sk0_48,sk0_47),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f427,plain,
( pd0_0(sk0_50,sk0_49)
| rearsegP(sk0_50,sk0_49) ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f428,plain,
! [W,X] :
( ~ pd0_0(X,W)
| ( nil = X
& nil = W ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| nil = X0 ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f430,plain,
! [X0,X1] :
( ~ pd0_0(X0,X1)
| nil = X1 ),
inference(cnf_transformation,[status(esa)],[f428]) ).
fof(f431,plain,
( spl0_0
<=> pd0_0(sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f432,plain,
( pd0_0(sk0_50,sk0_49)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f431]) ).
fof(f438,plain,
( spl0_2
<=> rearsegP(sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f439,plain,
( rearsegP(sk0_50,sk0_49)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f427,f431,f438]) ).
fof(f474,plain,
( spl0_3
<=> ssList(nil) ),
introduced(split_symbol_definition) ).
fof(f476,plain,
( ~ ssList(nil)
| spl0_3 ),
inference(component_clause,[status(thm)],[f474]) ).
fof(f484,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f476,f223]) ).
fof(f485,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f484]) ).
fof(f490,plain,
( pd0_0(sk0_48,sk0_49)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f432]) ).
fof(f491,plain,
( pd0_0(sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f424,f490]) ).
fof(f492,plain,
( nil = sk0_47
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f491,f430]) ).
fof(f493,plain,
( nil = sk0_48
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f491,f429]) ).
fof(f495,plain,
( ~ rearsegP(sk0_48,nil)
| ~ spl0_0 ),
inference(backward_demodulation,[status(thm)],[f492,f425]) ).
fof(f501,plain,
( ~ rearsegP(nil,nil)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f493,f495]) ).
fof(f502,plain,
( ~ ssList(nil)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f501,f309]) ).
fof(f503,plain,
( ~ spl0_3
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f502,f474,f431]) ).
fof(f507,plain,
( rearsegP(sk0_48,sk0_49)
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f423,f439]) ).
fof(f508,plain,
( rearsegP(sk0_48,sk0_47)
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f424,f507]) ).
fof(f511,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f425,f508]) ).
fof(f512,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f511]) ).
fof(f513,plain,
$false,
inference(sat_refutation,[status(thm)],[f441,f485,f503,f512]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC367+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n027.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 11:42:32 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 0.14/0.33 % Refutation found
% 0.14/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.54 % Elapsed time: 0.021266 seconds
% 0.14/0.54 % CPU time: 0.019101 seconds
% 0.14/0.54 % Memory used: 4.066 MB
%------------------------------------------------------------------------------