TSTP Solution File: SWW469+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWW469+1 : TPTP v8.1.2. Released v5.3.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 : Tue Apr 30 20:50:18 EDT 2024
% Result : Theorem 0.09s 0.32s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 4 unt; 0 def)
% Number of atoms : 83 ( 16 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 87 ( 36 ~; 32 |; 10 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 ( 12 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
( hoare_165779456gleton
<=> ? [S,T] :
( is_state(S)
& is_state(T)
& S != T ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,hypothesis,
hoare_165779456gleton,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,conjecture,
! [T] :
( is_state(T)
=> ~ ! [S] :
( is_state(S)
=> S = T ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
~ ! [T] :
( is_state(T)
=> ~ ! [S] :
( is_state(S)
=> S = T ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f10,plain,
( ( ~ hoare_165779456gleton
| ? [S,T] :
( is_state(S)
& is_state(T)
& S != T ) )
& ( hoare_165779456gleton
| ! [S,T] :
( ~ is_state(S)
| ~ is_state(T)
| S = T ) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f11,plain,
( ( ~ hoare_165779456gleton
| ( is_state(sk0_0)
& is_state(sk0_1)
& sk0_0 != sk0_1 ) )
& ( hoare_165779456gleton
| ! [S,T] :
( ~ is_state(S)
| ~ is_state(T)
| S = T ) ) ),
inference(skolemization,[status(esa)],[f10]) ).
fof(f12,plain,
( ~ hoare_165779456gleton
| is_state(sk0_0) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f13,plain,
( ~ hoare_165779456gleton
| is_state(sk0_1) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f14,plain,
( ~ hoare_165779456gleton
| sk0_0 != sk0_1 ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f19,plain,
hoare_165779456gleton,
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f20,plain,
? [T] :
( is_state(T)
& ! [S] :
( ~ is_state(S)
| S = T ) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f21,plain,
( is_state(sk0_2)
& ! [S] :
( ~ is_state(S)
| S = sk0_2 ) ),
inference(skolemization,[status(esa)],[f20]) ).
fof(f23,plain,
! [X0] :
( ~ is_state(X0)
| X0 = sk0_2 ),
inference(cnf_transformation,[status(esa)],[f21]) ).
fof(f24,plain,
( spl0_0
<=> hoare_165779456gleton ),
introduced(split_symbol_definition) ).
fof(f26,plain,
( ~ hoare_165779456gleton
| spl0_0 ),
inference(component_clause,[status(thm)],[f24]) ).
fof(f27,plain,
( spl0_1
<=> is_state(sk0_0) ),
introduced(split_symbol_definition) ).
fof(f28,plain,
( is_state(sk0_0)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f27]) ).
fof(f30,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f12,f24,f27]) ).
fof(f31,plain,
( spl0_2
<=> is_state(sk0_1) ),
introduced(split_symbol_definition) ).
fof(f32,plain,
( is_state(sk0_1)
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f31]) ).
fof(f34,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f13,f24,f31]) ).
fof(f35,plain,
( spl0_3
<=> sk0_0 = sk0_1 ),
introduced(split_symbol_definition) ).
fof(f37,plain,
( sk0_0 != sk0_1
| spl0_3 ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,plain,
( ~ spl0_0
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f14,f24,f35]) ).
fof(f45,plain,
( sk0_0 = sk0_2
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f28,f23]) ).
fof(f47,plain,
! [X0] :
( ~ is_state(X0)
| X0 = sk0_0
| ~ spl0_1 ),
inference(backward_demodulation,[status(thm)],[f45,f23]) ).
fof(f49,plain,
( sk0_1 = sk0_0
| ~ spl0_2
| ~ spl0_1 ),
inference(resolution,[status(thm)],[f32,f47]) ).
fof(f50,plain,
( $false
| spl0_3
| ~ spl0_2
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f49,f37]) ).
fof(f51,plain,
( spl0_3
| ~ spl0_2
| ~ spl0_1 ),
inference(contradiction_clause,[status(thm)],[f50]) ).
fof(f52,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f26,f19]) ).
fof(f53,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f52]) ).
fof(f54,plain,
$false,
inference(sat_refutation,[status(thm)],[f30,f34,f38,f51,f53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWW469+1 : TPTP v8.1.2. Released v5.3.0.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.31 % Computer : n007.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon Apr 29 22:53:32 EDT 2024
% 0.09/0.31 % CPUTime :
% 0.09/0.32 % Drodi V3.6.0
% 0.09/0.32 % Refutation found
% 0.09/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.34 % Elapsed time: 0.014244 seconds
% 0.09/0.34 % CPU time: 0.017588 seconds
% 0.09/0.34 % Total memory used: 9.369 MB
% 0.09/0.34 % Net memory used: 9.243 MB
%------------------------------------------------------------------------------