TSTP Solution File: SWC006+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n018.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:07 EDT 2024
% Result : Theorem 0.07s 0.27s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 117 ( 36 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 124 ( 41 ~; 39 |; 30 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 36 ( 23 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ~ ssList(X)
| V != X
| U != W
| ? [Y] :
( ssList(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& app(app(Y,Z),X1) = V
& app(Y,X1) = U ) ) )
| ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| app(app(X2,X3),X4) != X
| app(X2,X4) != 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
| ? [Y] :
( ssList(Y)
& ? [Z] :
( ssList(Z)
& ? [X1] :
( ssList(X1)
& app(app(Y,Z),X1) = V
& app(Y,X1) = U ) ) )
| ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| app(app(X2,X3),X4) != X
| app(X2,X4) != W ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [U] :
( ssList(U)
& ? [V] :
( ssList(V)
& ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& V = X
& U = W
& ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| ! [X1] :
( ~ ssList(X1)
| app(app(Y,Z),X1) != V
| app(Y,X1) != U ) ) )
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X2,X3),X4) = X
& app(X2,X4) = 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
& ! [Y] :
( ~ ssList(Y)
| ! [Z] :
( ~ ssList(Z)
| ! [X1] :
( ~ ssList(X1)
| app(app(Y,Z),X1) != sk0_48
| app(Y,X1) != sk0_47 ) ) )
& ssList(sk0_51)
& ssList(sk0_52)
& ssList(sk0_53)
& app(app(sk0_51,sk0_52),sk0_53) = sk0_50
& app(sk0_51,sk0_53) = sk0_49 ),
inference(skolemization,[status(esa)],[f415]) ).
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,
! [X0,X1,X2] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X0,X1),X2) != sk0_48
| app(X0,X2) != sk0_47 ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
ssList(sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
ssList(sk0_52),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
ssList(sk0_53),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
app(app(sk0_51,sk0_52),sk0_53) = sk0_50,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
app(sk0_51,sk0_53) = sk0_49,
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f461,plain,
app(sk0_51,sk0_53) = sk0_47,
inference(forward_demodulation,[status(thm)],[f422,f428]) ).
fof(f462,plain,
( spl0_0
<=> ssList(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f464,plain,
( ~ ssList(sk0_51)
| spl0_0 ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,plain,
( spl0_1
<=> ssList(sk0_53) ),
introduced(split_symbol_definition) ).
fof(f467,plain,
( ~ ssList(sk0_53)
| spl0_1 ),
inference(component_clause,[status(thm)],[f465]) ).
fof(f473,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f467,f426]) ).
fof(f474,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f473]) ).
fof(f475,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f464,f424]) ).
fof(f476,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f475]) ).
fof(f477,plain,
app(app(sk0_51,sk0_52),sk0_53) = sk0_48,
inference(forward_demodulation,[status(thm)],[f421,f427]) ).
fof(f538,plain,
( spl0_15
<=> ssList(sk0_52) ),
introduced(split_symbol_definition) ).
fof(f540,plain,
( ~ ssList(sk0_52)
| spl0_15 ),
inference(component_clause,[status(thm)],[f538]) ).
fof(f543,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f540,f425]) ).
fof(f544,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f543]) ).
fof(f578,plain,
( spl0_22
<=> app(sk0_51,sk0_53) = sk0_47 ),
introduced(split_symbol_definition) ).
fof(f580,plain,
( app(sk0_51,sk0_53) != sk0_47
| spl0_22 ),
inference(component_clause,[status(thm)],[f578]) ).
fof(f581,plain,
( ~ ssList(sk0_51)
| ~ ssList(sk0_52)
| ~ ssList(sk0_53)
| app(sk0_51,sk0_53) != sk0_47 ),
inference(resolution,[status(thm)],[f423,f477]) ).
fof(f582,plain,
( ~ spl0_0
| ~ spl0_15
| ~ spl0_1
| ~ spl0_22 ),
inference(split_clause,[status(thm)],[f581,f462,f538,f465,f578]) ).
fof(f595,plain,
( sk0_47 != sk0_47
| spl0_22 ),
inference(forward_demodulation,[status(thm)],[f461,f580]) ).
fof(f596,plain,
( $false
| spl0_22 ),
inference(trivial_equality_resolution,[status(esa)],[f595]) ).
fof(f597,plain,
spl0_22,
inference(contradiction_clause,[status(thm)],[f596]) ).
fof(f598,plain,
$false,
inference(sat_refutation,[status(thm)],[f474,f476,f544,f582,f597]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n018.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue Apr 30 00:24:28 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.07/0.27 % Drodi V3.6.0
% 0.07/0.27 % Refutation found
% 0.07/0.27 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.27 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.28 % Elapsed time: 0.016067 seconds
% 0.07/0.28 % CPU time: 0.027755 seconds
% 0.07/0.28 % Total memory used: 14.754 MB
% 0.07/0.28 % Net memory used: 14.720 MB
%------------------------------------------------------------------------------