%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET889+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/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:48:53 PM UTC 2026
% Result : Theorem 4.24s 1.54s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 81 ( 31 unt; 3 def)
% Number of atoms : 335 ( 123 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 264 ( 97 ~; 124 |; 35 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 136 ( 1 sgn 128 !; 8 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X1
| X3 = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( X0 = singleton(X1)
| X0 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f9,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f10,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f11,conjecture,
! [X0] : powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_zfmisc_1) ).
fof(f12,negated_conjecture,
~ ! [X0] : powerset(singleton(X0)) = unordered_pair(empty_set,singleton(X0)),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f13,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f9]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] :
( in(X2,X0)
<~> in(X2,X1) )
| X0 = X1 ),
inference(ennf_transformation,[],[f10]) ).
fof(f16,plain,
? [X0] : powerset(singleton(X0)) != unordered_pair(empty_set,singleton(X0)),
inference(ennf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0,X1] :
( ( powerset(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| subset(X2,X0) )
& ( ~ subset(X2,X0)
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| subset(X2,X0) )
& ( ~ in(X2,X1)
| ~ subset(X2,X0) ) )
| X1 = powerset(X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f18,plain,
! [X0,X1] :
( ( powerset(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| subset(X3,X0) )
& ( ~ subset(X3,X0)
| in(X3,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| subset(X2,X0) )
& ( ~ in(X2,X1)
| ~ subset(X2,X0) ) )
| X1 = powerset(X0) ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( powerset(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| subset(X3,X0) )
& ( ~ subset(X3,X0)
| in(X3,X1) ) ) )
& ( ( ( in(sK0(X0,X1),X1)
| subset(sK0(X0,X1),X0) )
& ( ~ in(sK0(X0,X1),X1)
| ~ subset(sK0(X0,X1),X0) ) )
| X1 = powerset(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ( ( in(sK1(X0,X1,X2),X2)
| sK1(X0,X1,X2) = X1
| sK1(X0,X1,X2) = X0 )
& ( ~ in(sK1(X0,X1,X2),X2)
| ( sK1(X0,X1,X2) != X1
& sK1(X0,X1,X2) != X0 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ( ~ subset(X0,singleton(X1))
| X0 = singleton(X1)
| X0 = empty_set )
& ( ( singleton(X1) != X0
& empty_set != X0 )
| subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f25,plain,
! [X0,X1] :
( ( ~ subset(X0,singleton(X1))
| X0 = singleton(X1)
| X0 = empty_set )
& ( ( singleton(X1) != X0
& empty_set != X0 )
| subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ( in(X2,X0)
| in(X2,X1) )
& ( ~ in(X2,X0)
| ~ in(X2,X1) ) )
| X0 = X1 ),
inference(nnf_transformation,[],[f15]) ).
fof(f29,plain,
! [X0,X1] :
( ( ( in(sK4(X0,X1),X0)
| in(sK4(X0,X1),X1) )
& ( ~ in(sK4(X0,X1),X0)
| ~ in(sK4(X0,X1),X1) ) )
| X0 = X1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X2,sK4(X0,X1))],[f28]) ).
fof(f30,plain,
powerset(singleton(sK5)) != unordered_pair(empty_set,singleton(sK5)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f16]) ).
fof(f32,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f33,plain,
! [X3,X0,X1] :
( powerset(X0) != X1
| ~ in(X3,X1)
| subset(X3,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
! [X3,X0,X1] :
( powerset(X0) != X1
| ~ subset(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f37,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| ~ in(X4,X2)
| X1 = X4
| X0 = X4 ),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X1 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X0 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] :
( ~ subset(X0,singleton(X1))
| singleton(X1) = X0
| empty_set = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
! [X0,X1] :
( empty_set != X0
| subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f13]) ).
fof(f50,plain,
! [X0,X1] :
( in(sK4(X0,X1),X0)
| in(sK4(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X0)
| ~ in(sK4(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
powerset(singleton(sK5)) != unordered_pair(empty_set,singleton(sK5)),
inference(cnf_transformation,[],[f30]) ).
fof(f53,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f34]) ).
fof(f54,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f33]) ).
fof(f55,plain,
! [X2,X1,X4] :
( unordered_pair(X4,X1) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f39]) ).
fof(f56,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f55]) ).
fof(f57,plain,
! [X2,X0,X4] :
( unordered_pair(X0,X4) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f38]) ).
fof(f58,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f57]) ).
fof(f59,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f37]) ).
fof(f60,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(equality_resolution,[],[f46]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f32]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( in(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f56]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f58]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_62,plain,
! [X0: $i] : subset(empty_set,singleton(X0)),
inference(cnf_transformation,[],[f60]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( ( X0 = empty_set )
| ( singleton(X1) = X0 )
| ~ subset(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_67,plain,
! [X0: $i] : subset(X0,X0),
inference(cnf_transformation,[],[f49]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ in(sK4(X0,X1),X1)
| ~ in(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( in(sK4(X0,X1),X1)
| in(sK4(X0,X1),X0)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_70,negated_conjecture,
unordered_pair(empty_set,singleton(sK5)) != powerset(singleton(sK5)),
inference(cnf_transformation,[],[f52]) ).
tcf(c_787,definition,
iPr_def_10 = singleton(sK5),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_788,definition,
iPr_def_11 = unordered_pair(empty_set,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_789,definition,
iPr_def_12 = powerset(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_790,negated_conjecture,
iPr_def_11 != iPr_def_12,
inference(demodulation,[status(thm)],[c_70,c_789,c_787,c_788]) ).
tcf(c_1223,plain,
subset(empty_set,iPr_def_10),
inference(superposition,[status(thm)],[c_787,c_62]) ).
tcf(c_1224,plain,
unordered_pair(iPr_def_10,empty_set) = iPr_def_11,
inference(demodulation,[status(thm)],[c_788,c_50]) ).
tcf(c_1225,plain,
in(empty_set,iPr_def_11),
inference(superposition,[status(thm)],[c_1224,c_59]) ).
tcf(c_1226,plain,
in(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_1224,c_58]) ).
tcf(c_1248,plain,
! [X0: $i] :
( in(X0,iPr_def_12)
| ~ subset(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_789,c_53]) ).
tcf(c_1264,plain,
in(iPr_def_10,iPr_def_12),
inference(superposition,[status(thm)],[c_67,c_1248]) ).
tcf(c_1265,plain,
in(empty_set,iPr_def_12),
inference(superposition,[status(thm)],[c_1223,c_1248]) ).
tcf(c_1284,plain,
! [X0: $i] :
( subset(X0,iPr_def_10)
| ~ in(X0,iPr_def_12) ),
inference(superposition,[status(thm)],[c_789,c_54]) ).
tcf(c_1297,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ( X0 = empty_set )
| ~ in(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1224,c_60]) ).
tcf(c_1309,plain,
! [X0: $i] :
( ( X0 = empty_set )
| ( singleton(sK5) = X0 )
| ~ subset(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_787,c_64]) ).
tcf(c_1310,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ( X0 = empty_set )
| ~ subset(X0,iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_1309,c_787]) ).
tcf(c_1368,plain,
! [X0: $i] :
( subset(sK4(X0,iPr_def_12),iPr_def_10)
| in(sK4(X0,iPr_def_12),X0)
| ( X0 = iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_69,c_1284]) ).
tcf(c_1613,plain,
( subset(sK4(iPr_def_11,iPr_def_12),iPr_def_10)
| ( iPr_def_11 = iPr_def_12 )
| ( sK4(iPr_def_11,iPr_def_12) = iPr_def_10 )
| ( sK4(iPr_def_11,iPr_def_12) = empty_set ) ),
inference(superposition,[status(thm)],[c_1368,c_1297]) ).
tcf(c_1626,plain,
( subset(sK4(iPr_def_11,iPr_def_12),iPr_def_10)
| ( sK4(iPr_def_11,iPr_def_12) = iPr_def_10 )
| ( sK4(iPr_def_11,iPr_def_12) = empty_set ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1613,c_790]) ).
tcf(c_1647,plain,
( ( sK4(iPr_def_11,iPr_def_12) = iPr_def_10 )
| ( sK4(iPr_def_11,iPr_def_12) = empty_set ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1626,c_1310]) ).
tcf(c_1654,plain,
( ( iPr_def_11 = iPr_def_12 )
| ( sK4(iPr_def_11,iPr_def_12) = iPr_def_10 )
| ~ in(empty_set,iPr_def_12)
| ~ in(sK4(iPr_def_11,iPr_def_12),iPr_def_11) ),
inference(superposition,[status(thm)],[c_1647,c_68]) ).
tcf(c_1659,plain,
( ( sK4(iPr_def_11,iPr_def_12) = iPr_def_10 )
| ~ in(sK4(iPr_def_11,iPr_def_12),iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1654,c_790,c_1265]) ).
tcf(c_1668,plain,
( ( sK4(iPr_def_11,iPr_def_12) = iPr_def_10 )
| ~ in(empty_set,iPr_def_11) ),
inference(superposition,[status(thm)],[c_1647,c_1659]) ).
tcf(c_1669,plain,
sK4(iPr_def_11,iPr_def_12) = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_1668,c_1225]) ).
tcf(c_1670,plain,
( ( iPr_def_11 = iPr_def_12 )
| ~ in(iPr_def_10,iPr_def_12)
| ~ in(sK4(iPr_def_11,iPr_def_12),iPr_def_11) ),
inference(superposition,[status(thm)],[c_1669,c_68]) ).
tcf(c_1676,plain,
( ( iPr_def_11 = iPr_def_12 )
| ~ in(iPr_def_10,iPr_def_12)
| ~ in(iPr_def_10,iPr_def_11) ),
inference(light_normalisation,[status(thm)],[c_1670,c_1669]) ).
tcf(c_1677,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1676,c_790,c_1264,c_1226]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET889+1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.58 % Computer : n010.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Thu Sep 24 12:20:31 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.62 Running first-order theorem proving
% 0.12/0.62 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.64
% 0.16/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.64
% 0.16/0.64 % Detected problem language: tptp
% 0.16/0.65 % Proving...
% 4.24/1.54 % SZS status Started for theBenchmark.p
% 4.24/1.54 % SZS status Theorem for theBenchmark.p
% 4.24/1.54
% 4.24/1.54 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.24/1.54
% 4.24/1.54 % ------ iProver source info
% 4.24/1.54
% 4.24/1.54 % git: date: 2026-07-19 20:42:38 +0200
% 4.24/1.54 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.24/1.54 % git: non_committed_changes: false
% 4.24/1.54
% 4.24/1.54 % ------ Parsing...
% 4.24/1.54 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.24/1.54
% 4.24/1.54 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.24/1.54
% 4.24/1.54 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.24/1.54
% 4.24/1.54 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.24/1.54 % ------ Proving...
% 4.24/1.54 % ------ Problem Properties
% 4.24/1.54
% 4.24/1.54 %
% 4.24/1.54 % clauses 24
% 4.24/1.54 % conjectures 1
% 4.24/1.54 % EPR 6
% 4.24/1.54 % Horn 19
% 4.24/1.54 % unary 12
% 4.24/1.54 % binary 3
% 4.24/1.54 % lits 46
% 4.24/1.54 % lits eq 20
% 4.24/1.54 % fd_pure 0
% 4.24/1.54 % fd_pseudo 0
% 4.24/1.54 % fd_cond 0
% 4.24/1.54 % fd_pseudo_cond 8
% 4.24/1.54 % AC symbols 0
% 4.24/1.54
% 4.24/1.54 % ------ Schedule dynamic 5 is on
% 4.24/1.54
% 4.24/1.54 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.24/1.54
% 4.24/1.54
% 4.24/1.54 % ------
% 4.24/1.54 % Current options:
% 4.24/1.54 % ------
% 4.24/1.54
% 4.24/1.54
% 4.24/1.54 %
% 4.24/1.54
% 4.24/1.54 % ------ Proving...
% 4.24/1.54 %
% 4.24/1.54
% 4.24/1.54 % SZS status Theorem for theBenchmark.p
% 4.24/1.54
% 4.24/1.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.24/1.54
% 4.24/1.54
%------------------------------------------------------------------------------