TSTP Solution File: SWC043+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC043+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.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:00 EDT 2023
% Result : Theorem 0.06s 0.28s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 178 ( 77 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 204 ( 68 ~; 63 |; 54 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 51 (; 33 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( nil = app(U,V)
<=> ( nil = V
& nil = U ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f84,axiom,
! [U] :
( ssList(U)
=> app(U,nil) = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil != V
| V != X
| U != W
| nil = U
| ! [Y] :
( ssList(Y)
=> ( app(W,Y) != X
| ~ strictorderedP(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
& lt(X2,Z) ) ) ) ) ) )
| ( 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)
=> ( nil != V
| V != X
| U != W
| nil = U
| ! [Y] :
( ssList(Y)
=> ( app(W,Y) != X
| ~ strictorderedP(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
& lt(X2,Z) ) ) ) ) ) )
| ( nil != X
& nil = W ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f383,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( nil = app(U,V)
<=> ( nil = V
& nil = U ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f83]) ).
fof(f384,plain,
! [U] :
( ~ ssList(U)
| ! [V] :
( ~ ssList(V)
| ( ( nil != app(U,V)
| ( nil = V
& nil = U ) )
& ( nil = app(U,V)
| nil != V
| nil != U ) ) ) ),
inference(NNF_transformation,[status(esa)],[f383]) ).
fof(f385,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1)
| nil = X1 ),
inference(cnf_transformation,[status(esa)],[f384]) ).
fof(f388,plain,
! [U] :
( ~ ssList(U)
| app(U,nil) = U ),
inference(pre_NNF_transformation,[status(esa)],[f84]) ).
fof(f389,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[status(esa)],[f388]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& nil = V
& V = X
& U = W
& nil != U
& ? [Y] :
( ssList(Y)
& app(W,Y) = X
& strictorderedP(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
| ~ lt(X2,Z) ) ) ) ) )
& ( 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)
& nil = V
& V = X
& U = W
& nil != U
& ? [Y] :
( ssList(Y)
& app(W,Y) = X
& strictorderedP(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 )
| ~ lt(X2,Z) ) ) )
& ( nil = X
| nil != W ) ) ) ) ),
inference(miniscoping,[status(esa)],[f415]) ).
fof(f417,plain,
( ssList(sk0_47)
& ssList(sk0_48)
& ssList(sk0_49)
& ssList(sk0_50)
& nil = sk0_48
& sk0_48 = sk0_50
& sk0_47 = sk0_49
& nil != sk0_47
& ssList(sk0_51)
& app(sk0_49,sk0_51) = sk0_50
& strictorderedP(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 )
| ~ lt(X2,Z) ) )
& ( nil = sk0_50
| nil != sk0_49 ) ),
inference(skolemization,[status(esa)],[f416]) ).
fof(f418,plain,
ssList(sk0_47),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f422,plain,
nil = sk0_48,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f423,plain,
sk0_48 = sk0_50,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f424,plain,
sk0_47 = sk0_49,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f425,plain,
nil != sk0_47,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f426,plain,
ssList(sk0_51),
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f427,plain,
app(sk0_49,sk0_51) = sk0_50,
inference(cnf_transformation,[status(esa)],[f417]) ).
fof(f469,plain,
nil = sk0_50,
inference(forward_demodulation,[status(thm)],[f422,f423]) ).
fof(f474,plain,
app(sk0_47,sk0_51) = sk0_50,
inference(forward_demodulation,[status(thm)],[f424,f427]) ).
fof(f475,plain,
app(sk0_47,sk0_51) = nil,
inference(forward_demodulation,[status(thm)],[f469,f474]) ).
fof(f477,plain,
( spl0_2
<=> ssList(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f479,plain,
( ~ ssList(sk0_47)
| spl0_2 ),
inference(component_clause,[status(thm)],[f477]) ).
fof(f480,plain,
( spl0_3
<=> ssList(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f482,plain,
( ~ ssList(sk0_51)
| spl0_3 ),
inference(component_clause,[status(thm)],[f480]) ).
fof(f488,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f426]) ).
fof(f489,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f490,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f479,f418]) ).
fof(f491,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f490]) ).
fof(f497,plain,
( spl0_6
<=> nil = sk0_51 ),
introduced(split_symbol_definition) ).
fof(f498,plain,
( nil = sk0_51
| ~ spl0_6 ),
inference(component_clause,[status(thm)],[f497]) ).
fof(f500,plain,
( ~ ssList(sk0_47)
| ~ ssList(sk0_51)
| nil = sk0_51 ),
inference(resolution,[status(thm)],[f385,f475]) ).
fof(f501,plain,
( ~ spl0_2
| ~ spl0_3
| spl0_6 ),
inference(split_clause,[status(thm)],[f500,f477,f480,f497]) ).
fof(f507,plain,
( app(sk0_47,nil) = nil
| ~ spl0_6 ),
inference(backward_demodulation,[status(thm)],[f498,f475]) ).
fof(f511,plain,
( spl0_7
<=> nil = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f512,plain,
( nil = sk0_47
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f511]) ).
fof(f514,plain,
( ~ ssList(sk0_47)
| nil = sk0_47
| ~ spl0_6 ),
inference(paramodulation,[status(thm)],[f507,f389]) ).
fof(f515,plain,
( ~ spl0_2
| spl0_7
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f514,f477,f511,f497]) ).
fof(f520,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[status(thm)],[f512,f425]) ).
fof(f521,plain,
~ spl0_7,
inference(contradiction_clause,[status(thm)],[f520]) ).
fof(f522,plain,
$false,
inference(sat_refutation,[status(thm)],[f489,f491,f501,f515,f521]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC043+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.08 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.06/0.26 % Computer : n007.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Tue May 30 11:12:01 EDT 2023
% 0.06/0.26 % CPUTime :
% 0.06/0.27 % Drodi V3.5.1
% 0.06/0.28 % Refutation found
% 0.06/0.28 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.06/0.28 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.06/0.29 % Elapsed time: 0.018813 seconds
% 0.06/0.29 % CPU time: 0.031853 seconds
% 0.06/0.29 % Memory used: 16.160 MB
%------------------------------------------------------------------------------