%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWW469+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:27:09 PM UTC 2026
% Result : Theorem 4.55s 1.07s
% Output : Proof 4.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 56 ( 18 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 50 ( 21 ~; 14 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,hypothesis,
hoare_165779456gleton,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f5_nnf,plain,
hoare_165779456gleton,
inference(nnf_transformation,[status(thm)],[f5]) ).
cnf(c8,plain,
hoare_165779456gleton,
inference(cnf_transformation,[status(esa)],[f5_nnf]) ).
fof(f1,axiom,
( hoare_165779456gleton
<=> ? [S,T] :
( S != T
& is_state(T)
& is_state(S) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).
fof(f1_nnf,plain,
( ( ! [S,T] :
( S = T
| ~ is_state(T)
| ~ is_state(S) )
| hoare_165779456gleton )
& ( ? [S,T] :
( S != T
& is_state(T)
& is_state(S) )
| ~ hoare_165779456gleton ) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [S,T] :
( ( S = T
| ~ is_state(T)
| ~ is_state(S)
| hoare_165779456gleton )
& ( ( sk0 != sk1
& is_state(sk1)
& is_state(sk0) )
| ~ hoare_165779456gleton ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f1_nnf]) ).
cnf(c1,plain,
( is_state(sk0)
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p11,plain,
is_state(sk0),
inference(resolution,[status(thm)],[c8,c1]) ).
fof(f6,conjecture,
! [T] :
( is_state(T)
=> ~ ! [S] :
( is_state(S)
=> S = T ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
fof(f6_neg,negated_conjecture,
~ ! [T] :
( is_state(T)
=> ~ ! [S] :
( is_state(S)
=> S = T ) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f6_nnf,plain,
? [T] :
( ! [S] :
( S = T
| ~ is_state(S) )
& is_state(T) ),
inference(nnf_transformation,[status(thm)],[f6_neg]) ).
fof(f6_sk,plain,
! [S] :
( ( S = sk2
| ~ is_state(S) )
& is_state(sk2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f6_nnf]) ).
cnf(c10,plain,
( X1 = sk2
| ~ is_state(X1) ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p15,plain,
sk0 = sk2,
inference(resolution,[status(thm)],[p11,c10]) ).
fof(f0,axiom,
is_state(undefined_state(state)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_c_HOL_Oundefined_000tc__Com__Ostate) ).
fof(f0_nnf,plain,
is_state(undefined_state(state)),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
is_state(undefined_state(state)),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(p14,plain,
undefined_state(state) = sk2,
inference(resolution,[status(thm)],[c10,c0]) ).
cnf(p17,plain,
sk2 = sk0,
inference(superposition,[status(thm)],[p15,p14]) ).
cnf(c2,plain,
( is_state(sk1)
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p12,plain,
is_state(sk1),
inference(resolution,[status(thm)],[c8,c2]) ).
cnf(p16,plain,
sk1 = sk2,
inference(resolution,[status(thm)],[p12,c10]) ).
cnf(p20,plain,
sk1 = sk0,
inference(demodulation,[status(thm)],[p17,p16]) ).
cnf(c3,plain,
( sk0 != sk1
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p13,plain,
sk0 != sk1,
inference(resolution,[status(thm)],[c8,c3]) ).
cnf(p21,plain,
sk0 != sk0,
inference(superposition,[status(thm)],[p20,p13]) ).
cnf(p22,plain,
$false,
inference(equality_resolution,[status(thm)],[p21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW469+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 22:24:01 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.55/1.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.55/1.07 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------