%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW469+1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n016.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:29:43 PM UTC 2026
% Result : Theorem 1.21s 1.28s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 59 ( 21 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 25 ~; 14 |; 10 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn 10 !; 7 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
( hoare_165779456gleton
<=> ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).
fof(f6,axiom,
hoare_165779456gleton,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f7,conjecture,
! [X0] :
( is_state(X0)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
fof(f8,negated_conjecture,
~ ! [X0] :
( is_state(X0)
=> ~ ! [X1] :
( is_state(X1)
=> X1 = X0 ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
( hoare_165779456gleton
=> ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f13,plain,
( ~ hoare_165779456gleton
| ? [X0,X1] :
( X0 != X1
& is_state(X1)
& is_state(X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f14,plain,
? [X0] :
( is_state(X0)
& ! [X1] :
( ~ is_state(X1)
| X1 = X0 ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
( ~ hoare_165779456gleton
| ( sK0 != sK1
& is_state(sK1)
& is_state(sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f13]) ).
fof(f16,plain,
( is_state(sK2)
& ! [X1] :
( ~ is_state(X1)
| sK2 = X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f14]) ).
fof(f18,plain,
( ~ hoare_165779456gleton
| sK0 != sK1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f19,plain,
( ~ hoare_165779456gleton
| is_state(sK1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
( ~ hoare_165779456gleton
| is_state(sK0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
hoare_165779456gleton,
inference(cnf_transformation,[],[f6]) ).
fof(f23,plain,
! [X1] :
( ~ is_state(X1)
| sK2 = X1 ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_50,plain,
( is_state(sK0)
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_51,plain,
( is_state(sK1)
| ~ hoare_165779456gleton ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_52,plain,
( ~ hoare_165779456gleton
| ( sK0 != sK1 ) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_53,plain,
hoare_165779456gleton,
inference(cnf_transformation,[],[f21]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] :
( ( X0 = sK2 )
| ~ is_state(X0) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_57,plain,
is_state(sK1),
inference(global_subsumption_just,[status(thm)],[c_51,c_53,c_51]) ).
tcf(c_59,plain,
is_state(sK0),
inference(global_subsumption_just,[status(thm)],[c_50,c_53,c_50]) ).
tcf(c_61,plain,
sK0 != sK1,
inference(global_subsumption_just,[status(thm)],[c_52,c_53,c_52]) ).
tcf(c_91,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_54]) ).
tcf(c_92,plain,
sK0 = sK2,
inference(unflattening,[status(thm)],[c_91]) ).
tcf(c_96,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_57,c_54]) ).
tcf(c_97,plain,
sK1 = sK2,
inference(unflattening,[status(thm)],[c_96]) ).
tcf(c_114,plain,
sK0 = sK1,
inference(demodulation,[status(thm)],[c_97,c_92]) ).
tcf(c_116,plain,
sK0 != sK0,
inference(demodulation,[status(thm)],[c_61,c_114]) ).
tcf(c_117,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW469+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 22:33:14 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.21/1.28 % SZS status Started for theBenchmark.p
% 1.21/1.28 % SZS status Theorem for theBenchmark.p
% 1.21/1.28
% 1.21/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.21/1.28
% 1.21/1.28 % ------ iProver source info
% 1.21/1.28
% 1.21/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.21/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.21/1.28 % git: non_committed_changes: false
% 1.21/1.28
% 1.21/1.28 % ------ Parsing...
% 1.21/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.21/1.28
% 1.21/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe_e %
% 1.21/1.28
% 1.21/1.28 % SZS status Theorem for theBenchmark.p
% 1.21/1.28
% 1.21/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.21/1.28
% 1.21/1.28
%------------------------------------------------------------------------------