TSTP Solution File: SWC405+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWC405+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:45:40 EDT 2024
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 89 ( 10 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 98 ( 32 ~; 28 |; 26 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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(X,Y)
& memberP(W,Y) )
| ( ~ memberP(W,Y)
& memberP(X,Y) ) ) )
| ! [Z] :
( ssItem(Z)
=> ( ~ memberP(U,Z)
| memberP(V,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(X,Y)
& memberP(W,Y) )
| ( ~ memberP(W,Y)
& memberP(X,Y) ) ) )
| ! [Z] :
( ssItem(Z)
=> ( ~ memberP(U,Z)
| memberP(V,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(X,Y)
| ~ memberP(W,Y) )
& ( memberP(W,Y)
| ~ memberP(X,Y) ) ) )
& ? [Z] :
( ssItem(Z)
& memberP(U,Z)
& ~ memberP(V,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_50,Y)
| ~ memberP(sk0_49,Y) )
& ( memberP(sk0_49,Y)
| ~ memberP(sk0_50,Y) ) ) )
& ssItem(sk0_51)
& memberP(sk0_47,sk0_51)
& ~ memberP(sk0_48,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_50,X0)
| ~ memberP(sk0_49,X0) ),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f425,plain,
ssItem(sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f426,plain,
memberP(sk0_47,sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f427,plain,
~ memberP(sk0_48,sk0_51),
inference(cnf_transformation,[status(esa)],[f416]) ).
fof(f460,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_48,X0)
| ~ memberP(sk0_49,X0) ),
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f461,plain,
! [X0] :
( ~ ssItem(X0)
| memberP(sk0_48,X0)
| ~ memberP(sk0_47,X0) ),
inference(forward_demodulation,[status(thm)],[f422,f460]) ).
fof(f462,plain,
( spl0_0
<=> ssItem(sk0_51) ),
introduced(split_symbol_definition) ).
fof(f464,plain,
( ~ ssItem(sk0_51)
| spl0_0 ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,plain,
( spl0_1
<=> memberP(sk0_48,sk0_51) ),
introduced(split_symbol_definition) ).
fof(f466,plain,
( memberP(sk0_48,sk0_51)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f465]) ).
fof(f468,plain,
( ~ ssItem(sk0_51)
| memberP(sk0_48,sk0_51) ),
inference(resolution,[status(thm)],[f461,f426]) ).
fof(f469,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f468,f462,f465]) ).
fof(f470,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f464,f425]) ).
fof(f471,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f470]) ).
fof(f472,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f466,f427]) ).
fof(f473,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f472]) ).
fof(f474,plain,
$false,
inference(sat_refutation,[status(thm)],[f469,f471,f473]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC405+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 00:12:48 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.36 % Drodi V3.6.0
% 0.12/0.37 % Refutation found
% 0.12/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.38 % Elapsed time: 0.025485 seconds
% 0.12/0.38 % CPU time: 0.030373 seconds
% 0.12/0.38 % Total memory used: 12.456 MB
% 0.12/0.38 % Net memory used: 12.430 MB
%------------------------------------------------------------------------------