TSTP Solution File: SWC288+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC288+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n025.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:39:55 EDT 2023
% Result : Theorem 0.19s 0.36s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 8 unt; 0 def)
% Number of atoms : 181 ( 40 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 210 ( 72 ~; 64 |; 58 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 60 (; 40 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,axiom,
! [U] :
( ssItem(U)
=> strictorderedP(cons(U,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f69,axiom,
strictorderedP(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
| strictorderedP(U)
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ~ ssList(X1)
| cons(Y,nil) != W
| app(app(Z,W),X1) != X
| ? [X2] :
( ssItem(X2)
& memberP(Z,X2)
& lt(Y,X2) )
| ? [X3] :
( ssItem(X3)
& memberP(X1,X3)
& lt(X3,Y) ) ) ) )
& ( nil != X
| nil != W ) ) ) ) ) ),
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
| strictorderedP(U)
| ( ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ~ ssList(X1)
| cons(Y,nil) != W
| app(app(Z,W),X1) != X
| ? [X2] :
( ssItem(X2)
& memberP(Z,X2)
& lt(Y,X2) )
| ? [X3] :
( ssItem(X3)
& memberP(X1,X3)
& lt(X3,Y) ) ) ) )
& ( nil != X
| nil != W ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f347,plain,
! [U] :
( ~ ssItem(U)
| strictorderedP(cons(U,nil)) ),
inference(pre_NNF_transformation,[status(esa)],[f68]) ).
fof(f348,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[status(esa)],[f347]) ).
fof(f349,plain,
strictorderedP(nil),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ strictorderedP(U)
& ( ? [Y] :
( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& cons(Y,nil) = W
& app(app(Z,W),X1) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(Z,X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(X1,X3)
| ~ lt(X3,Y) ) ) ) )
| ( nil = X
& nil = W ) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f97]) ).
fof(f416,plain,
! [W,X,Y] :
( pd0_0(Y,X,W)
=> ( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& cons(Y,nil) = W
& app(app(Z,W),X1) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(Z,X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(X1,X3)
| ~ lt(X3,Y) ) ) ) ) ),
introduced(predicate_definition,[f415]) ).
fof(f417,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ~ strictorderedP(U)
& ( ? [Y] : pd0_0(Y,X,W)
| ( nil = X
& nil = 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
& ~ strictorderedP(sk0_47)
& ( pd0_0(sk0_51,sk0_50,sk0_49)
| ( nil = sk0_50
& nil = 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,
~ strictorderedP(sk0_47),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f427,plain,
( pd0_0(sk0_51,sk0_50,sk0_49)
| nil = sk0_49 ),
inference(cnf_transformation,[status(esa)],[f418]) ).
fof(f428,plain,
! [W,X,Y] :
( ~ pd0_0(Y,X,W)
| ( ssItem(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& cons(Y,nil) = W
& app(app(Z,W),X1) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(Z,X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(X1,X3)
| ~ lt(X3,Y) ) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
! [W,X,Y] :
( ~ pd0_0(Y,X,W)
| ( ssItem(Y)
& ssList(sk0_52(Y,X,W))
& ssList(sk0_53(Y,X,W))
& cons(Y,nil) = W
& app(app(sk0_52(Y,X,W),W),sk0_53(Y,X,W)) = X
& ! [X2] :
( ~ ssItem(X2)
| ~ memberP(sk0_52(Y,X,W),X2)
| ~ lt(Y,X2) )
& ! [X3] :
( ~ ssItem(X3)
| ~ memberP(sk0_53(Y,X,W),X3)
| ~ lt(X3,Y) ) ) ),
inference(skolemization,[status(esa)],[f428]) ).
fof(f430,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| ssItem(X0) ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f433,plain,
! [X0,X1,X2] :
( ~ pd0_0(X0,X1,X2)
| cons(X0,nil) = X2 ),
inference(cnf_transformation,[status(esa)],[f429]) ).
fof(f437,plain,
( spl0_0
<=> pd0_0(sk0_51,sk0_50,sk0_49) ),
introduced(split_symbol_definition) ).
fof(f438,plain,
( pd0_0(sk0_51,sk0_50,sk0_49)
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f437]) ).
fof(f444,plain,
( spl0_2
<=> nil = sk0_49 ),
introduced(split_symbol_definition) ).
fof(f445,plain,
( nil = sk0_49
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f444]) ).
fof(f447,plain,
( spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f427,f437,f444]) ).
fof(f480,plain,
( pd0_0(sk0_51,sk0_48,sk0_49)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f423,f438]) ).
fof(f481,plain,
( pd0_0(sk0_51,sk0_48,sk0_47)
| ~ spl0_0 ),
inference(forward_demodulation,[status(thm)],[f424,f480]) ).
fof(f482,plain,
( ssItem(sk0_51)
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f481,f430]) ).
fof(f483,plain,
( cons(sk0_51,nil) = sk0_47
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f433,f481]) ).
fof(f484,plain,
( spl0_3
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f486,plain,
( ~ ssItem(sk0_51)
| spl0_3 ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f487,plain,
( spl0_4
<=> strictorderedP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f488,plain,
( strictorderedP(sk0_47)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f487]) ).
fof(f490,plain,
( ~ ssItem(sk0_51)
| strictorderedP(sk0_47)
| ~ spl0_0 ),
inference(paramodulation,[status(thm)],[f483,f348]) ).
fof(f491,plain,
( ~ spl0_3
| spl0_4
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f490,f484,f487,f437]) ).
fof(f510,plain,
( $false
| ~ spl0_0
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f482]) ).
fof(f511,plain,
( ~ spl0_0
| spl0_3 ),
inference(contradiction_clause,[status(thm)],[f510]) ).
fof(f513,plain,
( nil = sk0_47
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f424,f445]) ).
fof(f518,plain,
( ~ strictorderedP(nil)
| ~ spl0_2 ),
inference(backward_demodulation,[status(thm)],[f513,f425]) ).
fof(f519,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f518,f349]) ).
fof(f520,plain,
~ spl0_2,
inference(contradiction_clause,[status(thm)],[f519]) ).
fof(f553,plain,
( $false
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f425,f488]) ).
fof(f554,plain,
~ spl0_4,
inference(contradiction_clause,[status(thm)],[f553]) ).
fof(f555,plain,
$false,
inference(sat_refutation,[status(thm)],[f447,f491,f511,f520,f554]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC288+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 : n025.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:31:57 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.19/0.36 % Refutation found
% 0.19/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.25/0.58 % Elapsed time: 0.021846 seconds
% 0.25/0.58 % CPU time: 0.053193 seconds
% 0.25/0.58 % Memory used: 16.225 MB
%------------------------------------------------------------------------------