%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU257+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.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 02:56:23 PM UTC 2026
% Result : Theorem 2.29s 16.33s
% Output : CNFRefutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 103 ( 25 unt; 1 def)
% Number of atoms : 328 ( 7 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 358 ( 165 ~; 151 |; 24 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 84 !; 4 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( relation(X0)
=> ( well_ordering(X0)
<=> ( well_founded_relation(X0)
& connected(X0)
& antisymmetric(X0)
& transitive(X0)
& reflexive(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_wellord1) ).
fof(f4,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f8,axiom,
! [X0,X1] :
( relation(X1)
=> ( reflexive(X1)
=> reflexive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_wellord1) ).
fof(f9,axiom,
! [X0,X1] :
( relation(X1)
=> ( connected(X1)
=> connected(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_wellord1) ).
fof(f10,axiom,
! [X0,X1] :
( relation(X1)
=> ( transitive(X1)
=> transitive(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_wellord1) ).
fof(f11,axiom,
! [X0,X1] :
( relation(X1)
=> ( antisymmetric(X1)
=> antisymmetric(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_wellord1) ).
fof(f12,axiom,
! [X0,X1] :
( relation(X1)
=> ( well_founded_relation(X1)
=> well_founded_relation(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t31_wellord1) ).
fof(f13,conjecture,
! [X0,X1] :
( relation(X1)
=> ( well_ordering(X1)
=> well_ordering(relation_restriction(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_wellord1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( well_ordering(X1)
=> well_ordering(relation_restriction(X1,X0)) ) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f16,plain,
! [X0] :
( ~ relation(X0)
| ( well_ordering(X0)
<=> ( well_founded_relation(X0)
& connected(X0)
& antisymmetric(X0)
& transitive(X0)
& reflexive(X0) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f18,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f19,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ reflexive(X1)
| reflexive(relation_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ reflexive(X1)
| reflexive(relation_restriction(X1,X0)) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ connected(X1)
| connected(relation_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f22,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ connected(X1)
| connected(relation_restriction(X1,X0)) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ transitive(X1)
| transitive(relation_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ transitive(X1)
| transitive(relation_restriction(X1,X0)) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ antisymmetric(X1)
| antisymmetric(relation_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f26,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ antisymmetric(X1)
| antisymmetric(relation_restriction(X1,X0)) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ well_founded_relation(X1)
| well_founded_relation(relation_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f28,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ well_founded_relation(X1)
| well_founded_relation(relation_restriction(X1,X0)) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
? [X0,X1] :
( relation(X1)
& well_ordering(X1)
& ~ well_ordering(relation_restriction(X1,X0)) ),
inference(ennf_transformation,[],[f14]) ).
fof(f30,plain,
? [X0,X1] :
( relation(X1)
& well_ordering(X1)
& ~ well_ordering(relation_restriction(X1,X0)) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ~ relation(X0)
| ( ( ~ well_ordering(X0)
| ( well_founded_relation(X0)
& connected(X0)
& antisymmetric(X0)
& transitive(X0)
& reflexive(X0) ) )
& ( ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0)
| well_ordering(X0) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0] :
( ~ relation(X0)
| ( ( ~ well_ordering(X0)
| ( well_founded_relation(X0)
& connected(X0)
& antisymmetric(X0)
& transitive(X0)
& reflexive(X0) ) )
& ( ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0)
| well_ordering(X0) ) ) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
( relation(sK1)
& well_ordering(sK1)
& ~ well_ordering(relation_restriction(sK1,sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f30]) ).
fof(f35,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| well_founded_relation(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f36,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| connected(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f37,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| antisymmetric(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f38,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| transitive(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f39,plain,
! [X0] :
( ~ relation(X0)
| ~ well_ordering(X0)
| reflexive(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f40,plain,
! [X0] :
( ~ relation(X0)
| ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0)
| well_ordering(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f42,plain,
! [X0,X1] :
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f44,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ reflexive(X1)
| reflexive(relation_restriction(X1,X0)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f45,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ connected(X1)
| connected(relation_restriction(X1,X0)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f46,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ transitive(X1)
| transitive(relation_restriction(X1,X0)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f47,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ antisymmetric(X1)
| antisymmetric(relation_restriction(X1,X0)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0,X1] :
( ~ relation(X1)
| ~ well_founded_relation(X1)
| well_founded_relation(relation_restriction(X1,X0)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f49,plain,
relation(sK1),
inference(cnf_transformation,[],[f33]) ).
fof(f50,plain,
well_ordering(sK1),
inference(cnf_transformation,[],[f33]) ).
fof(f51,plain,
~ well_ordering(relation_restriction(sK1,sK0)),
inference(cnf_transformation,[],[f33]) ).
tcf(c_50,plain,
! [X0: $i] :
( well_ordering(X0)
| ~ relation(X0)
| ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_51,plain,
! [X0: $i] :
( reflexive(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_52,plain,
! [X0: $i] :
( transitive(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_53,plain,
! [X0: $i] :
( antisymmetric(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_54,plain,
! [X0: $i] :
( connected(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_55,plain,
! [X0: $i] :
( well_founded_relation(X0)
| ~ relation(X0)
| ~ well_ordering(X0) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( reflexive(relation_restriction(X0,X1))
| ~ relation(X0)
| ~ reflexive(X0) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( connected(relation_restriction(X0,X1))
| ~ relation(X0)
| ~ connected(X0) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( transitive(relation_restriction(X0,X1))
| ~ relation(X0)
| ~ transitive(X0) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( antisymmetric(relation_restriction(X0,X1))
| ~ relation(X0)
| ~ antisymmetric(X0) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( well_founded_relation(relation_restriction(X0,X1))
| ~ relation(X0)
| ~ well_founded_relation(X0) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_64,negated_conjecture,
~ well_ordering(relation_restriction(sK1,sK0)),
inference(cnf_transformation,[],[f51]) ).
tcf(c_65,negated_conjecture,
well_ordering(sK1),
inference(cnf_transformation,[],[f50]) ).
tcf(c_66,negated_conjecture,
relation(sK1),
inference(cnf_transformation,[],[f49]) ).
tcf(c_69,plain,
( well_founded_relation(sK1)
| ~ relation(sK1)
| ~ well_ordering(sK1) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_70,plain,
( connected(sK1)
| ~ relation(sK1)
| ~ well_ordering(sK1) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_71,plain,
( antisymmetric(sK1)
| ~ relation(sK1)
| ~ well_ordering(sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_72,plain,
( transitive(sK1)
| ~ relation(sK1)
| ~ well_ordering(sK1) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_73,plain,
( reflexive(sK1)
| ~ relation(sK1)
| ~ well_ordering(sK1) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_275,plain,
! [X0: $i] :
( ~ relation(X0)
| ~ well_founded_relation(X0)
| ~ connected(X0)
| ~ antisymmetric(X0)
| ~ transitive(X0)
| ~ reflexive(X0)
| ( relation_restriction(sK1,sK0) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_64]) ).
tcf(c_276,plain,
( ~ relation(relation_restriction(sK1,sK0))
| ~ well_founded_relation(relation_restriction(sK1,sK0))
| ~ connected(relation_restriction(sK1,sK0))
| ~ antisymmetric(relation_restriction(sK1,sK0))
| ~ transitive(relation_restriction(sK1,sK0))
| ~ reflexive(relation_restriction(sK1,sK0)) ),
inference(unflattening,[status(thm)],[c_275]) ).
tcf(c_295,plain,
! [X0: $i] :
( well_founded_relation(X0)
| ~ relation(X0)
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_65]) ).
tcf(c_296,plain,
( well_founded_relation(sK1)
| ~ relation(sK1) ),
inference(unflattening,[status(thm)],[c_295]) ).
tcf(c_297,plain,
well_founded_relation(sK1),
inference(global_subsumption_just,[status(thm)],[c_296,c_66,c_65,c_69]) ).
tcf(c_302,plain,
! [X0: $i] :
( connected(X0)
| ~ relation(X0)
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_65]) ).
tcf(c_303,plain,
( connected(sK1)
| ~ relation(sK1) ),
inference(unflattening,[status(thm)],[c_302]) ).
tcf(c_304,plain,
connected(sK1),
inference(global_subsumption_just,[status(thm)],[c_303,c_66,c_65,c_70]) ).
tcf(c_309,plain,
! [X0: $i] :
( antisymmetric(X0)
| ~ relation(X0)
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_65]) ).
tcf(c_310,plain,
( antisymmetric(sK1)
| ~ relation(sK1) ),
inference(unflattening,[status(thm)],[c_309]) ).
tcf(c_311,plain,
antisymmetric(sK1),
inference(global_subsumption_just,[status(thm)],[c_310,c_66,c_65,c_71]) ).
tcf(c_316,plain,
! [X0: $i] :
( transitive(X0)
| ~ relation(X0)
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_65]) ).
tcf(c_317,plain,
( transitive(sK1)
| ~ relation(sK1) ),
inference(unflattening,[status(thm)],[c_316]) ).
tcf(c_318,plain,
transitive(sK1),
inference(global_subsumption_just,[status(thm)],[c_317,c_66,c_65,c_72]) ).
tcf(c_323,plain,
! [X0: $i] :
( reflexive(X0)
| ~ relation(X0)
| ( X0 != sK1 ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_65]) ).
tcf(c_324,plain,
( reflexive(sK1)
| ~ relation(sK1) ),
inference(unflattening,[status(thm)],[c_323]) ).
tcf(c_325,plain,
reflexive(sK1),
inference(global_subsumption_just,[status(thm)],[c_324,c_66,c_65,c_73]) ).
tcf(c_473,definition,
iPr_def_10 = relation_restriction(sK1,sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_475,plain,
reflexive(sK1),
inference(demodulation,[status(thm)],[c_325]) ).
tcf(c_476,plain,
transitive(sK1),
inference(demodulation,[status(thm)],[c_318]) ).
tcf(c_477,plain,
antisymmetric(sK1),
inference(demodulation,[status(thm)],[c_311]) ).
tcf(c_478,plain,
connected(sK1),
inference(demodulation,[status(thm)],[c_304]) ).
tcf(c_479,plain,
well_founded_relation(sK1),
inference(demodulation,[status(thm)],[c_297]) ).
tcf(c_480,plain,
( ~ relation(iPr_def_10)
| ~ well_founded_relation(iPr_def_10)
| ~ connected(iPr_def_10)
| ~ antisymmetric(iPr_def_10)
| ~ transitive(iPr_def_10)
| ~ reflexive(iPr_def_10) ),
inference(demodulation,[status(thm)],[c_276]) ).
tcf(c_481,negated_conjecture,
relation(sK1),
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_756,plain,
( relation(iPr_def_10)
| ~ relation(sK1) ),
inference(superposition,[status(thm)],[c_473,c_57]) ).
tcf(c_757,plain,
relation(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_756,c_481]) ).
tcf(c_758,plain,
( ~ well_founded_relation(iPr_def_10)
| ~ connected(iPr_def_10)
| ~ antisymmetric(iPr_def_10)
| ~ transitive(iPr_def_10)
| ~ reflexive(iPr_def_10) ),
inference(backward_subsumption_resolution,[status(thm)],[c_480,c_757]) ).
tcf(c_770,plain,
( reflexive(iPr_def_10)
| ~ relation(sK1)
| ~ reflexive(sK1) ),
inference(superposition,[status(thm)],[c_473,c_59]) ).
tcf(c_771,plain,
reflexive(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_770,c_481,c_475]) ).
tcf(c_778,plain,
( connected(iPr_def_10)
| ~ relation(sK1)
| ~ connected(sK1) ),
inference(superposition,[status(thm)],[c_473,c_60]) ).
tcf(c_779,plain,
connected(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_778,c_481,c_478]) ).
tcf(c_780,plain,
( ~ well_founded_relation(iPr_def_10)
| ~ transitive(iPr_def_10)
| ~ antisymmetric(iPr_def_10) ),
inference(global_subsumption_just,[status(thm)],[c_758,c_480,c_757,c_771,c_779]) ).
tcf(c_781,plain,
( ~ well_founded_relation(iPr_def_10)
| ~ antisymmetric(iPr_def_10)
| ~ transitive(iPr_def_10) ),
inference(renaming,[status(thm)],[c_780]) ).
tcf(c_794,plain,
( transitive(iPr_def_10)
| ~ relation(sK1)
| ~ transitive(sK1) ),
inference(superposition,[status(thm)],[c_473,c_61]) ).
tcf(c_795,plain,
transitive(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_794,c_481,c_476]) ).
tcf(c_796,plain,
( ~ well_founded_relation(iPr_def_10)
| ~ antisymmetric(iPr_def_10) ),
inference(backward_subsumption_resolution,[status(thm)],[c_781,c_795]) ).
tcf(c_809,plain,
( antisymmetric(iPr_def_10)
| ~ relation(sK1)
| ~ antisymmetric(sK1) ),
inference(superposition,[status(thm)],[c_473,c_62]) ).
tcf(c_810,plain,
antisymmetric(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_809,c_481,c_477]) ).
tcf(c_811,plain,
~ well_founded_relation(iPr_def_10),
inference(backward_subsumption_resolution,[status(thm)],[c_796,c_810]) ).
tcf(c_818,plain,
( well_founded_relation(iPr_def_10)
| ~ relation(sK1)
| ~ well_founded_relation(sK1) ),
inference(superposition,[status(thm)],[c_473,c_63]) ).
tcf(c_819,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_818,c_811,c_481,c_479]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU257+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/15.39 % Computer : n009.cluster.edu
% 0.12/15.39 % Model : x86_64 x86_64
% 0.12/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.39 % Memory : 8046.5625MB
% 0.12/15.39 % OS : Linux 6.8.0-71-generic
% 0.12/15.39 % CPULimit : 300
% 0.12/15.39 % WCLimit : 300
% 0.12/15.39 % DateTime : Thu Sep 24 13:26:15 UTC 2026
% 0.12/15.39 % CPUTime :
% 0.12/15.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/15.43 Running first-order theorem proving
% 0.16/15.44 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.16/15.45
% 0.16/15.45 % ======== iProver multi-core TPTP/SMT =========
% 0.16/15.45
% 0.16/15.45 % Detected problem language: tptp
% 0.16/15.46 % Proving...
% 2.29/16.33 % SZS status Started for theBenchmark.p
% 2.29/16.33 % SZS status Theorem for theBenchmark.p
% 2.29/16.33
% 2.29/16.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.29/16.33
% 2.29/16.33 % ------ iProver source info
% 2.29/16.33
% 2.29/16.33 % git: date: 2026-07-19 20:42:38 +0200
% 2.29/16.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.29/16.33 % git: non_committed_changes: false
% 2.29/16.33
% 2.29/16.33 % ------ Parsing...
% 2.29/16.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.29/16.33
% 2.29/16.33 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.29/16.33
% 2.29/16.33 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.29/16.33
% 2.29/16.33 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.29/16.33 % ------ Proving...
% 2.29/16.33 % ------ Problem Properties
% 2.29/16.33
% 2.29/16.33 %
% 2.29/16.33 % clauses 18
% 2.29/16.33 % conjectures 1
% 2.29/16.33 % EPR 8
% 2.29/16.33 % Horn 18
% 2.29/16.33 % unary 10
% 2.29/16.33 % binary 2
% 2.29/16.33 % lits 35
% 2.29/16.33 % lits eq 5
% 2.29/16.33 % fd_pure 0
% 2.29/16.33 % fd_pseudo 0
% 2.29/16.33 % fd_cond 0
% 2.29/16.33 % fd_pseudo_cond 0
% 2.29/16.33 % AC symbols 0
% 2.29/16.33
% 2.29/16.33 % ------ Schedule dynamic 5 is on
% 2.29/16.33
% 2.29/16.33 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.29/16.33
% 2.29/16.33
% 2.29/16.33 % ------
% 2.29/16.33 % Current options:
% 2.29/16.33 % ------
% 2.29/16.33
% 2.29/16.33
% 2.29/16.33 %
% 2.29/16.33
% 2.29/16.33 % ------ Proving...
% 2.29/16.33 %
% 2.29/16.33
% 2.29/16.33 % SZS status Theorem for theBenchmark.p
% 2.29/16.33
% 2.29/16.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.29/16.33
% 2.29/16.33
%------------------------------------------------------------------------------