TSTP Solution File: SWC353+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC353+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n019.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:09 EDT 2023
% Result : Theorem 0.10s 0.34s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 14 unt; 0 def)
% Number of atoms : 178 ( 47 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 209 ( 71 ~; 67 |; 53 &)
% ( 6 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 58 (; 37 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( frontsegP(U,V)
<=> ? [W] :
( ssList(W)
& app(V,W) = 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
| ! [Y] :
( ssList(Y)
=> ( app(W,Y) != X
| ~ totalorderedP(W)
| ? [Z] :
( ssItem(Z)
& ? [X1] :
( ssList(X1)
& app(cons(Z,nil),X1) = Y
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& app(X3,cons(X2,nil)) = W
& leq(X2,Z) ) ) ) ) ) )
| frontsegP(V,U)
| ( nil != X
& nil = 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
| ! [Y] :
( ssList(Y)
=> ( app(W,Y) != X
| ~ totalorderedP(W)
| ? [Z] :
( ssItem(Z)
& ? [X1] :
( ssList(X1)
& app(cons(Z,nil),X1) = Y
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& app(X3,cons(X2,nil)) = W
& leq(X2,Z) ) ) ) ) ) )
| frontsegP(V,U)
| ( nil != X
& nil = W ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f119,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( frontsegP(U,V)
<=> ? [W] :
( ssList(W)
& app(V,W) = U ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f120,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ frontsegP(U,V)
| ? [W] :
( ssList(W)
& app(V,W) = U ) )
& ( frontsegP(U,V)
| ! [W] :
( ~ ssList(W)
| app(V,W) != U ) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f119]) ).
fof(f121,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( ~ frontsegP(U,V)
| ( ssList(sk0_5(V,U))
& app(V,sk0_5(V,U)) = U ) )
& ( frontsegP(U,V)
| ! [W] :
( ~ ssList(W)
| app(V,W) != U ) ) ) ) ),
inference(skolemization,[status(esa)],[f120]) ).
fof(f124,plain,
! [X0,X1,X2] :
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0 ),
inference(cnf_transformation,[status(esa)],[f121]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ? [Y] :
( ssList(Y)
& app(W,Y) = X
& totalorderedP(W)
& ! [Z] :
( ~ ssItem(Z)
| ! [X1] :
( ~ ssList(X1)
| app(cons(Z,nil),X1) != Y
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X3,cons(X2,nil)) != W
| ~ leq(X2,Z) ) ) ) ) )
& ~ frontsegP(V,U)
& ( nil = X
| nil != W ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ? [Y] :
( ssList(Y)
& app(W,Y) = X
& totalorderedP(W)
& ! [Z] :
( ~ ssItem(Z)
| ! [X1] :
( ~ ssList(X1)
| app(cons(Z,nil),X1) != Y )
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X3,cons(X2,nil)) != W )
| ~ leq(X2,Z) ) ) )
& ~ frontsegP(V,U)
& ( nil = X
| nil != W ) ) ) ) ),
inference(miniscoping,[status(esa)],[f415]) ).
fof(f417,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& ssList(sk0_51)
& app(sk0_49,sk0_51) = sk0_50
& totalorderedP(sk0_49)
& ! [Z] :
( ~ ssItem(Z)
| ! [X1] :
( ~ ssList(X1)
| app(cons(Z,nil),X1) != sk0_51 )
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X3,cons(X2,nil)) != sk0_49 )
| ~ leq(X2,Z) ) )
& ~ frontsegP(sk0_48,sk0_47)
& ( nil = sk0_50
| nil != sk0_49 ) ),
inference(skolemization,[status(esa)],[f416]) ).
fof(f418,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f419,plain,
ssList(sk0_48),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f422,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f423,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f424,plain,
ssList(sk0_51),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f425,plain,
app(sk0_49,sk0_51) = sk0_50,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f428,plain,
~ frontsegP(sk0_48,sk0_47),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f441,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| frontsegP(app(X0,X1),X0)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(esa)],[f124]) ).
fof(f470,plain,
app(sk0_47,sk0_51) = sk0_50,
inference(forward_demodulation,[status(thm)],[f423,f425]) ).
fof(f471,plain,
app(sk0_47,sk0_51) = sk0_48,
inference(forward_demodulation,[status(thm)],[f422,f470]) ).
fof(f472,plain,
( spl0_2
<=> ssList(app(sk0_47,sk0_51)) ),
introduced(split_symbol_definition) ).
fof(f474,plain,
( ~ ssList(app(sk0_47,sk0_51))
| spl0_2 ),
inference(component_clause,[status(thm)],[f472]) ).
fof(f475,plain,
( spl0_3
<=> ssList(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f477,plain,
( ~ ssList(sk0_47)
| spl0_3 ),
inference(component_clause,[status(thm)],[f475]) ).
fof(f478,plain,
( spl0_4
<=> frontsegP(sk0_48,sk0_47) ),
introduced(split_symbol_definition) ).
fof(f479,plain,
( frontsegP(sk0_48,sk0_47)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f478]) ).
fof(f481,plain,
( spl0_5
<=> ssList(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f483,plain,
( ~ ssList(sk0_51)
| spl0_5 ),
inference(component_clause,[status(thm)],[f481]) ).
fof(f484,plain,
( ~ ssList(app(sk0_47,sk0_51))
| ~ ssList(sk0_47)
| frontsegP(sk0_48,sk0_47)
| ~ ssList(sk0_51) ),
inference(paramodulation,[status(thm)],[f471,f441]) ).
fof(f485,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_4
| ~ spl0_5 ),
inference(split_clause,[status(thm)],[f484,f472,f475,f478,f481]) ).
fof(f486,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f483,f424]) ).
fof(f487,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f486]) ).
fof(f488,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f477,f418]) ).
fof(f489,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f490,plain,
( ~ ssList(sk0_48)
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f471,f474]) ).
fof(f491,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f490,f419]) ).
fof(f492,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f491]) ).
fof(f493,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f479,f428]) ).
fof(f494,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f493]) ).
fof(f495,plain,
$false,
inference(sat_refutation,[status(thm)],[f485,f487,f489,f492,f494]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWC353+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n019.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue May 30 11:19:55 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.5.1
% 0.10/0.34 % Refutation found
% 0.10/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.18/0.56 % Elapsed time: 0.016437 seconds
% 0.18/0.56 % CPU time: 0.017475 seconds
% 0.18/0.56 % Memory used: 4.052 MB
%------------------------------------------------------------------------------