TSTP Solution File: SWC411+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWC411+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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:22 EDT 2023
% Result : Theorem 0.17s 0.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 81 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 86 ( 28 ~; 24 |; 22 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 (; 15 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( V != X
| U != W
| ? [Y] :
( ssItem(Y)
& ~ memberP(W,Y)
& memberP(X,Y) )
| ! [Z] :
( ssItem(Z)
=> ( ~ memberP(V,Z)
| memberP(U,Z) ) ) ) ) ) ) ),
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] :
( ssItem(Y)
& ~ memberP(W,Y)
& memberP(X,Y) )
| ! [Z] :
( ssItem(Z)
=> ( ~ memberP(V,Z)
| memberP(U,Z) ) ) ) ) ) ) ),
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] :
( ~ ssItem(Y)
| memberP(W,Y)
| ~ memberP(X,Y) )
& ? [Z] :
( ssItem(Z)
& memberP(V,Z)
& ~ memberP(U,Z) ) ) ) ) ),
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] :
( ~ ssItem(Y)
| memberP(sk0_49,Y)
| ~ memberP(sk0_50,Y) )
& ssItem(sk0_51)
& memberP(sk0_48,sk0_51)
& ~ memberP(sk0_47,sk0_51) ),
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] :
( ~ ssItem(X0)
| memberP(sk0_49,X0)
| ~ memberP(sk0_50,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f424,plain,
ssItem(sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
memberP(sk0_48,sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
~ memberP(sk0_47,sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f459,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_47,X0)
| ~ memberP(sk0_50,X0) ),
inference(forward_demodulation,[status(thm)],[f422,f423]) ).
fof(f460,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_47,X0)
| ~ memberP(sk0_48,X0) ),
inference(forward_demodulation,[status(thm)],[f421,f459]) ).
fof(f461,plain,
( spl0_0
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f463,plain,
( ~ ssItem(sk0_51)
| spl0_0 ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( spl0_1
<=> memberP(sk0_47,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f465,plain,
( memberP(sk0_47,sk0_51)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f464]) ).
fof(f467,plain,
( ~ ssItem(sk0_51)
| memberP(sk0_47,sk0_51) ),
inference(resolution,[status(thm)],[f460,f425]) ).
fof(f468,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f467,f461,f464]) ).
fof(f469,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f463,f424]) ).
fof(f470,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f469]) ).
fof(f471,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f465,f426]) ).
fof(f472,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f471]) ).
fof(f473,plain,
$false,
inference(sat_refutation,[status(thm)],[f468,f470,f472]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC411+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % 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:22:52 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.5.1
% 0.17/0.55 % Refutation found
% 0.17/0.55 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.55 % Elapsed time: 0.017520 seconds
% 0.17/0.55 % CPU time: 0.019184 seconds
% 0.17/0.55 % Memory used: 4.035 MB
%------------------------------------------------------------------------------