TSTP Solution File: SWC001+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC001+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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:06 EDT 2024
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 140 ( 10 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 166 ( 60 ~; 58 |; 34 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 ( 18 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ~ duplicatefreeP(W)
| ? [Y] :
( ssItem(Y)
& ( ( ~ memberP(X,Y)
& memberP(W,Y) )
| ( ~ memberP(W,Y)
& memberP(X,Y) ) ) )
| ( ! [Z] :
( ssItem(Z)
=> ( ( ~ memberP(V,Z)
& ~ memberP(U,Z) )
| ( memberP(V,Z)
& memberP(U,Z) ) ) )
& duplicatefreeP(U) ) ) ) ) ) ),
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
| ~ duplicatefreeP(W)
| ? [Y] :
( ssItem(Y)
& ( ( ~ memberP(X,Y)
& memberP(W,Y) )
| ( ~ memberP(W,Y)
& memberP(X,Y) ) ) )
| ( ! [Z] :
( ssItem(Z)
=> ( ( ~ memberP(V,Z)
& ~ memberP(U,Z) )
| ( memberP(V,Z)
& memberP(U,Z) ) ) )
& duplicatefreeP(U) ) ) ) ) ) ),
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
& duplicatefreeP(W)
& ! [Y] :
( ~ ssItem(Y)
| ( ( memberP(X,Y)
| ~ memberP(W,Y) )
& ( memberP(W,Y)
| ~ memberP(X,Y) ) ) )
& ( ? [Z] :
( ssItem(Z)
& ( memberP(V,Z)
| memberP(U,Z) )
& ( ~ memberP(V,Z)
| ~ memberP(U,Z) ) )
| ~ duplicatefreeP(U) ) ) ) ) ),
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
& duplicatefreeP(sk0_49)
& ! [Y] :
( ~ ssItem(Y)
| ( ( memberP(sk0_50,Y)
| ~ memberP(sk0_49,Y) )
& ( memberP(sk0_49,Y)
| ~ memberP(sk0_50,Y) ) ) )
& ( ( ssItem(sk0_51)
& ( memberP(sk0_48,sk0_51)
| memberP(sk0_47,sk0_51) )
& ( ~ memberP(sk0_48,sk0_51)
| ~ memberP(sk0_47,sk0_51) ) )
| ~ duplicatefreeP(sk0_47) ) ),
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,
duplicatefreeP(sk0_49),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_50,X0)
| ~ memberP(sk0_49,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_49,X0)
| ~ memberP(sk0_50,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
( ssItem(sk0_51)
| ~ duplicatefreeP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
( memberP(sk0_48,sk0_51)
| memberP(sk0_47,sk0_51)
| ~ duplicatefreeP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f428,plain,
( ~ memberP(sk0_48,sk0_51)
| ~ memberP(sk0_47,sk0_51)
| ~ duplicatefreeP(sk0_47) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f429,plain,
( spl0_0
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f432,plain,
( spl0_1
<=> duplicatefreeP(sk0_47) ),
introduced(split_symbol_definition) ).
fof(f434,plain,
( ~ duplicatefreeP(sk0_47)
| spl0_1 ),
inference(component_clause,[status(thm)],[f432]) ).
fof(f435,plain,
( spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f426,f429,f432]) ).
fof(f436,plain,
( spl0_2
<=> memberP(sk0_48,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f437,plain,
( memberP(sk0_48,sk0_51)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f436]) ).
fof(f439,plain,
( spl0_3
<=> memberP(sk0_47,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f440,plain,
( memberP(sk0_47,sk0_51)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f439]) ).
fof(f442,plain,
( spl0_2
| spl0_3
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f427,f436,f439,f432]) ).
fof(f443,plain,
( ~ spl0_2
| ~ spl0_3
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f428,f436,f439,f432]) ).
fof(f476,plain,
duplicatefreeP(sk0_47),
inference(forward_demodulation,[status(thm)],[f422,f423]) ).
fof(f477,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_48,X0)
| ~ memberP(sk0_49,X0) ),
inference(forward_demodulation,[status(thm)],[f421,f424]) ).
fof(f478,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_48,X0)
| ~ memberP(sk0_47,X0) ),
inference(forward_demodulation,[status(thm)],[f422,f477]) ).
fof(f479,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_47,X0)
| ~ memberP(sk0_50,X0) ),
inference(forward_demodulation,[status(thm)],[f422,f425]) ).
fof(f480,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_47,X0)
| ~ memberP(sk0_48,X0) ),
inference(forward_demodulation,[status(thm)],[f421,f479]) ).
fof(f481,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f434,f476]) ).
fof(f482,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f481]) ).
fof(f483,plain,
( ~ ssItem(sk0_51)
| memberP(sk0_47,sk0_51)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f437,f480]) ).
fof(f484,plain,
( ~ spl0_0
| spl0_3
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f483,f429,f439,f436]) ).
fof(f485,plain,
( ~ ssItem(sk0_51)
| memberP(sk0_48,sk0_51)
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f440,f478]) ).
fof(f486,plain,
( ~ spl0_0
| spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f485,f429,f436,f439]) ).
fof(f487,plain,
$false,
inference(sat_refutation,[status(thm)],[f435,f442,f443,f482,f484,f486]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC001+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.35 % Computer : n013.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Apr 30 00:00:34 EDT 2024
% 0.12/0.36 % CPUTime :
% 0.12/0.37 % Drodi V3.6.0
% 0.12/0.38 % Refutation found
% 0.12/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.40 % Elapsed time: 0.027513 seconds
% 0.12/0.40 % CPU time: 0.040600 seconds
% 0.12/0.40 % Total memory used: 14.645 MB
% 0.12/0.40 % Net memory used: 14.623 MB
%------------------------------------------------------------------------------