%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU239+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 : n010.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:18 PM UTC 2026
% Result : Theorem 3.76s 1.73s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 77 ( 15 unt; 4 def)
% Number of atoms : 239 ( 14 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 254 ( 109 ~; 111 |; 20 &)
% ( 6 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 90 !; 9 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( in(X2,X1)
=> in(ordered_pair(X2,X2),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_2) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_relat_2) ).
fof(f25,conjecture,
! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_wellord1) ).
fof(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( reflexive(X0)
<=> ! [X1] :
( in(X1,relation_field(X0))
=> in(ordered_pair(X1,X1),X0) ) ) ),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f45,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( is_reflexive_in(X0,X1)
<=> ! [X2] :
( ~ in(X2,X1)
| in(ordered_pair(X2,X2),X0) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0] :
( ~ relation(X0)
| ( reflexive(X0)
<=> is_reflexive_in(X0,relation_field(X0)) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f50,plain,
? [X0] :
( relation(X0)
& ( reflexive(X0)
<~> ! [X1] :
( ~ in(X1,relation_field(X0))
| in(ordered_pair(X1,X1),X0) ) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f57,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( ~ is_reflexive_in(X0,X1)
| ! [X2] :
( ~ in(X2,X1)
| in(ordered_pair(X2,X2),X0) ) )
& ( ? [X2] :
( in(X2,X1)
& ~ in(ordered_pair(X2,X2),X0) )
| is_reflexive_in(X0,X1) ) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f58,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( ~ is_reflexive_in(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| in(ordered_pair(X3,X3),X0) ) )
& ( ? [X2] :
( in(X2,X1)
& ~ in(ordered_pair(X2,X2),X0) )
| is_reflexive_in(X0,X1) ) ) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0] :
( ~ relation(X0)
| ! [X1] :
( ( ~ is_reflexive_in(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| in(ordered_pair(X3,X3),X0) ) )
& ( ( in(sK0(X0,X1),X1)
& ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0) )
| is_reflexive_in(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f58]) ).
fof(f60,plain,
! [X0] :
( ~ relation(X0)
| ( ( ~ reflexive(X0)
| is_reflexive_in(X0,relation_field(X0)) )
& ( ~ is_reflexive_in(X0,relation_field(X0))
| reflexive(X0) ) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f62,plain,
? [X0] :
( relation(X0)
& ( reflexive(X0)
| ! [X1] :
( ~ in(X1,relation_field(X0))
| in(ordered_pair(X1,X1),X0) ) )
& ( ~ reflexive(X0)
| ? [X1] :
( in(X1,relation_field(X0))
& ~ in(ordered_pair(X1,X1),X0) ) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f63,plain,
? [X0] :
( relation(X0)
& ( reflexive(X0)
| ! [X1] :
( ~ in(X1,relation_field(X0))
| in(ordered_pair(X1,X1),X0) ) )
& ( ~ reflexive(X0)
| ? [X1] :
( in(X1,relation_field(X0))
& ~ in(ordered_pair(X1,X1),X0) ) ) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
? [X0] :
( relation(X0)
& ( reflexive(X0)
| ! [X2] :
( ~ in(X2,relation_field(X0))
| in(ordered_pair(X2,X2),X0) ) )
& ( ~ reflexive(X0)
| ? [X1] :
( in(X1,relation_field(X0))
& ~ in(ordered_pair(X1,X1),X0) ) ) ),
inference(rectify,[],[f63]) ).
fof(f65,plain,
( relation(sK2)
& ( reflexive(sK2)
| ! [X2] :
( ~ in(X2,relation_field(sK2))
| in(ordered_pair(X2,X2),sK2) ) )
& ( ~ reflexive(sK2)
| ( in(sK3,relation_field(sK2))
& ~ in(ordered_pair(sK3,sK3),sK2) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f64]) ).
fof(f75,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f77,plain,
! [X3,X0,X1] :
( ~ relation(X0)
| ~ is_reflexive_in(X0,X1)
| ~ in(X3,X1)
| in(ordered_pair(X3,X3),X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f78,plain,
! [X0,X1] :
( ~ relation(X0)
| in(sK0(X0,X1),X1)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f79,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(ordered_pair(sK0(X0,X1),sK0(X0,X1)),X0)
| is_reflexive_in(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f80,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f82,plain,
! [X0] :
( ~ relation(X0)
| ~ reflexive(X0)
| is_reflexive_in(X0,relation_field(X0)) ),
inference(cnf_transformation,[],[f60]) ).
fof(f83,plain,
! [X0] :
( ~ relation(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| reflexive(X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f90,plain,
relation(sK2),
inference(cnf_transformation,[],[f65]) ).
fof(f91,plain,
! [X2] :
( reflexive(sK2)
| ~ in(X2,relation_field(sK2))
| in(ordered_pair(X2,X2),sK2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f92,plain,
( ~ reflexive(sK2)
| in(sK3,relation_field(sK2)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f93,plain,
( ~ reflexive(sK2)
| ~ in(ordered_pair(sK3,sK3),sK2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f109,plain,
! [X0,X1] :
( ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK0(X0,X1)),singleton(sK0(X0,X1))),X0)
| is_reflexive_in(X0,X1) ),
inference(definition_unfolding,[],[f79,f80]) ).
fof(f110,plain,
! [X3,X0,X1] :
( ~ relation(X0)
| ~ is_reflexive_in(X0,X1)
| ~ in(X3,X1)
| in(unordered_pair(unordered_pair(X3,X3),singleton(X3)),X0) ),
inference(definition_unfolding,[],[f77,f80]) ).
fof(f112,plain,
( ~ reflexive(sK2)
| ~ in(unordered_pair(unordered_pair(sK3,sK3),singleton(sK3)),sK2) ),
inference(definition_unfolding,[],[f93,f80]) ).
fof(f113,plain,
! [X2] :
( reflexive(sK2)
| ~ in(X2,relation_field(sK2))
| in(unordered_pair(unordered_pair(X2,X2),singleton(X2)),sK2) ),
inference(definition_unfolding,[],[f91,f80]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f75]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| ~ relation(X0)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK0(X0,X1)),singleton(sK0(X0,X1))),X0) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| in(sK0(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),X2)
| ~ relation(X2)
| ~ is_reflexive_in(X2,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_57,plain,
! [X0: $i] :
( reflexive(X0)
| ~ relation(X0)
| ~ is_reflexive_in(X0,relation_field(X0)) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_58,plain,
! [X0: $i] :
( is_reflexive_in(X0,relation_field(X0))
| ~ reflexive(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_65,negated_conjecture,
( ~ reflexive(sK2)
| ~ in(unordered_pair(unordered_pair(sK3,sK3),singleton(sK3)),sK2) ),
inference(cnf_transformation,[],[f112]) ).
tcf(c_66,negated_conjecture,
( in(sK3,relation_field(sK2))
| ~ reflexive(sK2) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_67,negated_conjecture,
! [X0: $i] :
( reflexive(sK2)
| in(unordered_pair(unordered_pair(X0,X0),singleton(X0)),sK2)
| ~ in(X0,relation_field(sK2)) ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_68,negated_conjecture,
relation(sK2),
inference(cnf_transformation,[],[f90]) ).
tcf(c_289,plain,
( ~ reflexive(sK2)
| ~ in(unordered_pair(singleton(sK3),unordered_pair(sK3,sK3)),sK2) ),
inference(demodulation,[status(thm)],[c_65,c_51]) ).
tcf(c_300,plain,
! [X0: $i] :
( reflexive(sK2)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),sK2)
| ~ in(X0,relation_field(sK2)) ),
inference(demodulation,[status(thm)],[c_67,c_51]) ).
tcf(c_310,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),X2)
| ~ relation(X2)
| ~ is_reflexive_in(X2,X1)
| ~ in(X0,X1) ),
inference(demodulation,[status(thm)],[c_55,c_51]) ).
tcf(c_323,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| ~ relation(X0)
| ~ in(unordered_pair(singleton(sK0(X0,X1)),unordered_pair(sK0(X0,X1),sK0(X0,X1))),X0) ),
inference(demodulation,[status(thm)],[c_53,c_51]) ).
tcf(c_522,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| ~ in(unordered_pair(singleton(sK0(X0,X1)),unordered_pair(sK0(X0,X1),sK0(X0,X1))),X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_323,c_68]) ).
tcf(c_523,plain,
! [X0: $i] :
( is_reflexive_in(sK2,X0)
| ~ in(unordered_pair(singleton(sK0(sK2,X0)),unordered_pair(sK0(sK2,X0),sK0(sK2,X0))),sK2) ),
inference(unflattening,[status(thm)],[c_522]) ).
tcf(c_531,plain,
! [X0: $i] :
( is_reflexive_in(X0,relation_field(X0))
| ~ reflexive(X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_58,c_68]) ).
tcf(c_532,plain,
( is_reflexive_in(sK2,relation_field(sK2))
| ~ reflexive(sK2) ),
inference(unflattening,[status(thm)],[c_531]) ).
tcf(c_539,plain,
! [X0: $i] :
( reflexive(X0)
| ~ is_reflexive_in(X0,relation_field(X0))
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_57,c_68]) ).
tcf(c_540,plain,
( reflexive(sK2)
| ~ is_reflexive_in(sK2,relation_field(sK2)) ),
inference(unflattening,[status(thm)],[c_539]) ).
tcf(c_552,plain,
! [X0: $i,X1: $i] :
( is_reflexive_in(X0,X1)
| in(sK0(X0,X1),X1)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_68]) ).
tcf(c_553,plain,
! [X0: $i] :
( is_reflexive_in(sK2,X0)
| in(sK0(sK2,X0),X0) ),
inference(unflattening,[status(thm)],[c_552]) ).
tcf(c_678,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),X0)
| ~ is_reflexive_in(X0,X2)
| ~ in(X1,X2)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_310,c_68]) ).
tcf(c_679,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),sK2)
| ~ is_reflexive_in(sK2,X1)
| ~ in(X0,X1) ),
inference(unflattening,[status(thm)],[c_678]) ).
tcf(c_785,plain,
! [X0: $i] :
( is_reflexive_in(sK2,relation_field(sK2))
| in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),sK2)
| ~ in(X0,relation_field(sK2)) ),
inference(resolution,[status(thm)],[c_300,c_532]) ).
tcf(c_792,plain,
! [X0: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),sK2)
| ~ in(X0,relation_field(sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_785,c_679]) ).
tcf(c_2729,definition,
iPr_def_10 = relation_field(sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2733,definition,
iPr_def_14 = singleton(sK3),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_2734,definition,
iPr_def_15 = unordered_pair(sK3,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_2735,definition,
iPr_def_16 = unordered_pair(iPr_def_14,iPr_def_15),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_2736,plain,
! [X0: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),sK2)
| ~ in(X0,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_792,c_2729]) ).
tcf(c_2737,plain,
! [X0: $i,X1: $i] :
( in(unordered_pair(singleton(X0),unordered_pair(X0,X0)),sK2)
| ~ is_reflexive_in(sK2,X1)
| ~ in(X0,X1) ),
inference(demodulation,[status(thm)],[c_679]) ).
tcf(c_2738,plain,
! [X0: $i] :
( is_reflexive_in(sK2,X0)
| in(sK0(sK2,X0),X0) ),
inference(demodulation,[status(thm)],[c_553]) ).
tcf(c_2740,plain,
( reflexive(sK2)
| ~ is_reflexive_in(sK2,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_540]) ).
tcf(c_2741,plain,
( is_reflexive_in(sK2,iPr_def_10)
| ~ reflexive(sK2) ),
inference(demodulation,[status(thm)],[c_532]) ).
tcf(c_2742,plain,
! [X0: $i] :
( is_reflexive_in(sK2,X0)
| ~ in(unordered_pair(singleton(sK0(sK2,X0)),unordered_pair(sK0(sK2,X0),sK0(sK2,X0))),sK2) ),
inference(demodulation,[status(thm)],[c_523]) ).
tcf(c_2743,plain,
( ~ reflexive(sK2)
| ~ in(iPr_def_16,sK2) ),
inference(demodulation,[status(thm)],[c_289,c_2734,c_2733,c_2735]) ).
tcf(c_2744,negated_conjecture,
( in(sK3,iPr_def_10)
| ~ reflexive(sK2) ),
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_3670,plain,
( in(unordered_pair(singleton(sK3),unordered_pair(sK3,sK3)),sK2)
| ~ reflexive(sK2)
| ~ is_reflexive_in(sK2,iPr_def_10) ),
inference(superposition,[status(thm)],[c_2744,c_2737]) ).
tcf(c_3671,plain,
( in(iPr_def_16,sK2)
| ~ reflexive(sK2)
| ~ is_reflexive_in(sK2,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_3670,c_2733,c_2734,c_2735]) ).
tcf(c_3675,plain,
~ reflexive(sK2),
inference(global_subsumption_just,[status(thm)],[c_3671,c_2741,c_2743,c_3671]) ).
tcf(c_3677,plain,
~ is_reflexive_in(sK2,iPr_def_10),
inference(backward_subsumption_resolution,[status(thm)],[c_2740,c_3675]) ).
tcf(c_3691,plain,
! [X0: $i] :
( is_reflexive_in(sK2,X0)
| ~ in(sK0(sK2,X0),iPr_def_10) ),
inference(superposition,[status(thm)],[c_2736,c_2742]) ).
tcf(c_3699,plain,
is_reflexive_in(sK2,iPr_def_10),
inference(superposition,[status(thm)],[c_2738,c_3691]) ).
tcf(c_3700,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3699,c_3677]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU239+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.63 % Computer : n010.cluster.edu
% 0.15/0.63 % Model : x86_64 x86_64
% 0.15/0.63 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.63 % Memory : 8046.5625MB
% 0.15/0.63 % OS : Linux 6.8.0-71-generic
% 0.15/0.64 % CPULimit : 300
% 0.15/0.64 % WCLimit : 300
% 0.15/0.64 % DateTime : Thu Sep 24 13:22:01 UTC 2026
% 0.15/0.64 % CPUTime :
% 0.15/0.64 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.21/0.70 Running first-order theorem proving
% 0.21/0.70 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.21/0.72
% 0.21/0.72 % ======== iProver multi-core TPTP/SMT =========
% 0.21/0.72
% 0.21/0.72 % Detected problem language: tptp
% 0.21/0.74 % Proving...
% 3.76/1.73 % SZS status Started for theBenchmark.p
% 3.76/1.73 % SZS status Theorem for theBenchmark.p
% 3.76/1.73
% 3.76/1.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.76/1.73
% 3.76/1.73 % ------ iProver source info
% 3.76/1.73
% 3.76/1.73 % git: date: 2026-07-19 20:42:38 +0200
% 3.76/1.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.76/1.73 % git: non_committed_changes: false
% 3.76/1.73
% 3.76/1.73 % ------ Parsing...
% 3.76/1.73 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.76/1.73
% 3.76/1.73 % ------ Preprocessing... sup_sim: 5 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe_e %
% 3.76/1.73
% 3.76/1.73 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.76/1.73
% 3.76/1.73 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.76/1.73 % ------ Proving...
% 3.76/1.73 % ------ Problem Properties
% 3.76/1.73
% 3.76/1.73 %
% 3.76/1.73 % clauses 50
% 3.76/1.73 % conjectures 1
% 3.76/1.73 % EPR 13
% 3.76/1.73 % Horn 45
% 3.76/1.73 % unary 20
% 3.76/1.73 % binary 25
% 3.76/1.73 % lits 85
% 3.76/1.73 % lits eq 17
% 3.76/1.73 % fd_pure 0
% 3.76/1.73 % fd_pseudo 0
% 3.76/1.73 % fd_cond 1
% 3.76/1.73 % fd_pseudo_cond 1
% 3.76/1.73 % AC symbols 0
% 3.76/1.73
% 3.76/1.73 % ------ Schedule dynamic 5 is on
% 3.76/1.73
% 3.76/1.73 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.76/1.73
% 3.76/1.73
% 3.76/1.73 % ------
% 3.76/1.73 % Current options:
% 3.76/1.73 % ------
% 3.76/1.73
% 3.76/1.73
% 3.76/1.73 %
% 3.76/1.73
% 3.76/1.73 % ------ Proving...
% 3.76/1.73 %
% 3.76/1.73
% 3.76/1.73 % SZS status Theorem for theBenchmark.p
% 3.76/1.73
% 3.76/1.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.76/1.73
% 3.76/1.73
%------------------------------------------------------------------------------