TSTP Solution File: SWC051+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC051+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n022.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.19s 0.37s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 9 unt; 0 def)
% Number of atoms : 142 ( 18 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 153 ( 55 ~; 53 |; 30 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,U) ),
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
| ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& rearsegP(V,Y)
& rearsegP(U,Y) )
| ( nil != W
& nil = X )
| ( neq(X,nil)
& ( ~ 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
| ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& rearsegP(V,Y)
& rearsegP(U,Y) )
| ( nil != W
& nil = X )
| ( neq(X,nil)
& ( ~ neq(W,nil)
| ~ rearsegP(X,W) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f304,plain,
! [U] :
( ~ ssList(U)
| rearsegP(U,U) ),
inference(pre_NNF_transformation,[status(esa)],[f49]) ).
fof(f305,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f304]) ).
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) )
& ( nil = W
| nil != X )
& ( ~ neq(X,nil)
| ( neq(W,nil)
& rearsegP(X,W) ) ) ) ) ) ),
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)
| ~ rearsegP(sk0_48,Y)
| ~ rearsegP(sk0_47,Y) )
& ( nil = sk0_49
| nil != sk0_50 )
& ( ~ neq(sk0_50,nil)
| ( neq(sk0_49,nil)
& rearsegP(sk0_50,sk0_49) ) ) ),
inference(skolemization,[status(esa)],[f415]) ).
fof(f417,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f416]) ).
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)
| ~ rearsegP(sk0_48,X0)
| ~ rearsegP(sk0_47,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( ~ neq(sk0_50,nil)
| neq(sk0_49,nil) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( ~ neq(sk0_50,nil)
| rearsegP(sk0_50,sk0_49) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f435,plain,
( spl0_2
<=> neq(sk0_50,nil) ),
introduced(split_symbol_definition) ).
fof(f437,plain,
( ~ neq(sk0_50,nil)
| spl0_2 ),
inference(component_clause,[status(thm)],[f435]) ).
fof(f438,plain,
( spl0_3
<=> neq(sk0_49,nil) ),
introduced(split_symbol_definition) ).
fof(f439,plain,
( neq(sk0_49,nil)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f438]) ).
fof(f441,plain,
( ~ spl0_2
| spl0_3 ),
inference(split_clause,[status(thm)],[f426,f435,f438]) ).
fof(f442,plain,
( spl0_4
<=> rearsegP(sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f443,plain,
( rearsegP(sk0_50,sk0_49)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f442]) ).
fof(f445,plain,
( ~ spl0_2
| spl0_4 ),
inference(split_clause,[status(thm)],[f427,f435,f442]) ).
fof(f480,plain,
rearsegP(sk0_47,sk0_47),
inference(resolution,[status(thm)],[f305,f417]) ).
fof(f489,plain,
( ~ neq(sk0_48,nil)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f421,f437]) ).
fof(f490,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f489,f423]) ).
fof(f491,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f490]) ).
fof(f492,plain,
( neq(sk0_47,nil)
| ~ spl0_3 ),
inference(forward_demodulation,[status(thm)],[f422,f439]) ).
fof(f493,plain,
( rearsegP(sk0_48,sk0_49)
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f421,f443]) ).
fof(f494,plain,
( rearsegP(sk0_48,sk0_47)
| ~ spl0_4 ),
inference(forward_demodulation,[status(thm)],[f422,f493]) ).
fof(f496,plain,
( spl0_5
<=> ssList(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f498,plain,
( ~ ssList(sk0_47)
| spl0_5 ),
inference(component_clause,[status(thm)],[f496]) ).
fof(f499,plain,
( spl0_6
<=> neq(sk0_47,nil) ),
introduced(split_symbol_definition) ).
fof(f501,plain,
( ~ neq(sk0_47,nil)
| spl0_6 ),
inference(component_clause,[status(thm)],[f499]) ).
fof(f502,plain,
( spl0_7
<=> rearsegP(sk0_47,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f504,plain,
( ~ rearsegP(sk0_47,sk0_47)
| spl0_7 ),
inference(component_clause,[status(thm)],[f502]) ).
fof(f505,plain,
( ~ ssList(sk0_47)
| ~ neq(sk0_47,nil)
| ~ rearsegP(sk0_47,sk0_47)
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f424,f494]) ).
fof(f506,plain,
( ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f505,f496,f499,f502,f442]) ).
fof(f537,plain,
( $false
| spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f504,f480]) ).
fof(f538,plain,
spl0_7,
inference(contradiction_clause,[status(thm)],[f537]) ).
fof(f539,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f498,f417]) ).
fof(f540,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f539]) ).
fof(f541,plain,
( $false
| ~ spl0_3
| spl0_6 ),
inference(forward_subsumption_resolution,[status(thm)],[f501,f492]) ).
fof(f542,plain,
( ~ spl0_3
| spl0_6 ),
inference(contradiction_clause,[status(thm)],[f541]) ).
fof(f543,plain,
$false,
inference(sat_refutation,[status(thm)],[f441,f445,f491,f506,f538,f540,f542]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SWC051+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 23:57:58 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % Drodi V3.6.0
% 0.19/0.37 % Refutation found
% 0.19/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.38 % Elapsed time: 0.031555 seconds
% 0.19/0.38 % CPU time: 0.046528 seconds
% 0.19/0.38 % Total memory used: 14.666 MB
% 0.19/0.38 % Net memory used: 14.641 MB
%------------------------------------------------------------------------------