%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET938+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 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 02:49:09 PM UTC 2026
% Result : Theorem 27.80s 12.30s
% Output : CNFRefutation 27.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 59 ( 13 unt; 0 def)
% Number of atoms : 206 ( 25 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 240 ( 93 ~; 105 |; 35 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 142 ( 0 sgn 133 !; 9 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( X1 = powerset(X0)
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f7,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_xboole_0) ).
fof(f14,conjecture,
! [X0,X1] : subset(set_union2(powerset(set_difference(X0,X1)),powerset(set_difference(X1,X0))),powerset(symmetric_difference(X0,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t86_zfmisc_1) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] : subset(set_union2(powerset(set_difference(X0,X1)),powerset(set_difference(X1,X0))),powerset(symmetric_difference(X0,X1))),
inference(negated_conjecture,[status(cth)],[f14]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f22,plain,
? [X0,X1] : ~ subset(set_union2(powerset(set_difference(X0,X1)),powerset(set_difference(X1,X0))),powerset(symmetric_difference(X0,X1))),
inference(ennf_transformation,[],[f15]) ).
fof(f23,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,[],[f4]) ).
fof(f24,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,[],[f23]) ).
fof(f25,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))],[f24]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ( ( in(sK1(X0,X1,X2),X2)
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0) )
& ( ~ in(sK1(X0,X1,X2),X2)
| ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f31]) ).
fof(f35,plain,
~ subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(symmetric_difference(sK5,sK6))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6]),skolemize(X0,sK5),skolemize(X1,sK6)],[f22]) ).
fof(f37,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f39,plain,
! [X3,X0,X1] :
( powerset(X0) != X1
| ~ in(X3,X1)
| subset(X3,X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X3,X0,X1] :
( powerset(X0) != X1
| ~ subset(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
! [X2,X0,X1,X4] :
( set_union2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f45,plain,
! [X2,X0,X1,X4] :
( set_union2(X0,X1) != X2
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f50,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f51,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
! [X0,X1] : symmetric_difference(X0,X1) = set_union2(set_difference(X0,X1),set_difference(X1,X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f59,plain,
~ subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(symmetric_difference(sK5,sK6))),
inference(cnf_transformation,[],[f35]) ).
fof(f61,plain,
~ subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),
inference(definition_unfolding,[],[f59,f52]) ).
fof(f62,plain,
! [X3,X0] :
( ~ subset(X3,X0)
| in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f40]) ).
fof(f63,plain,
! [X3,X0] :
( ~ in(X3,powerset(X0))
| subset(X3,X0) ),
inference(equality_resolution,[],[f39]) ).
fof(f64,plain,
! [X0,X1,X4] :
( ~ in(X4,X0)
| in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f45]) ).
fof(f66,plain,
! [X0,X1,X4] :
( ~ in(X4,set_union2(X0,X1))
| in(X4,X1)
| in(X4,X0) ),
inference(equality_resolution,[],[f43]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f37]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( in(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_union2(X1,X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| in(X0,X1)
| ~ in(X0,set_union2(X1,X2)) ),
inference(cnf_transformation,[],[f66]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_71,negated_conjecture,
~ subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),
inference(cnf_transformation,[],[f61]) ).
tcf(c_1557,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,set_union2(X1,X2))
| ~ in(sK2(X0,set_union2(X1,X2)),X1) ),
inference(superposition,[status(thm)],[c_59,c_62]) ).
tcf(c_1693,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,X2)
| in(sK2(X0,X2),X1)
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_63,c_64]) ).
tcf(c_1720,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_union2(X0,X1),X2)
| in(sK2(set_union2(X0,X1),X2),X1)
| in(sK2(set_union2(X0,X1),X2),X0) ),
inference(superposition,[status(thm)],[c_63,c_61]) ).
tcf(c_1910,plain,
! [X0: $i,X1: $i] :
( subset(X0,powerset(X1))
| ~ subset(sK2(X0,powerset(X1)),X1) ),
inference(superposition,[status(thm)],[c_54,c_62]) ).
tcf(c_2326,plain,
( subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5))))
| in(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),powerset(set_difference(sK6,sK5)))
| in(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),powerset(set_difference(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_1720]) ).
tcf(c_4190,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,set_union2(X1,X2))
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_1693,c_1557]) ).
tcf(c_4557,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,set_union2(X2,X1))
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_50,c_4190]) ).
tcf(c_4564,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,powerset(set_union2(X1,X2)))
| ~ subset(sK2(X0,powerset(set_union2(X1,X2))),X1) ),
inference(superposition,[status(thm)],[c_4190,c_1910]) ).
tcf(c_6572,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,powerset(set_union2(X1,X2)))
| ~ subset(sK2(X0,powerset(set_union2(X1,X2))),X2) ),
inference(superposition,[status(thm)],[c_4557,c_1910]) ).
tcf(c_12784,plain,
( subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5))))
| ~ subset(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),set_difference(sK6,sK5)) ),
inference(instantiation,[status(thm)],[c_6572]) ).
tcf(c_12892,plain,
( subset(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5))))
| ~ subset(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),set_difference(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_4564]) ).
tcf(c_14036,plain,
( subset(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),set_difference(sK6,sK5))
| ~ in(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),powerset(set_difference(sK6,sK5))) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_21358,plain,
! [X0: $i] :
( subset(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),X0)
| ~ in(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),powerset(X0)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_33323,plain,
( subset(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),set_difference(sK5,sK6))
| ~ in(sK2(set_union2(powerset(set_difference(sK5,sK6)),powerset(set_difference(sK6,sK5))),powerset(set_union2(set_difference(sK5,sK6),set_difference(sK6,sK5)))),powerset(set_difference(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_21358]) ).
tcf(c_33324,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_33323,c_14036,c_12892,c_12784,c_2326,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET938+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.40 % Computer : n017.cluster.edu
% 0.12/5.40 % Model : x86_64 x86_64
% 0.12/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40 % Memory : 8046.5625MB
% 0.12/5.40 % OS : Linux 6.8.0-71-generic
% 0.12/5.40 % CPULimit : 300
% 0.12/5.40 % WCLimit : 300
% 0.12/5.40 % DateTime : Thu Sep 24 12:20:23 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.12/5.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/5.44 Running first-order theorem proving
% 0.12/5.44 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.12/5.45
% 0.12/5.45 % ======== iProver multi-core TPTP/SMT =========
% 0.12/5.45
% 0.12/5.45 % Detected problem language: tptp
% 0.12/5.46 % Proving...
% 27.80/12.30 % SZS status Started for theBenchmark.p
% 27.80/12.30 % SZS status Theorem for theBenchmark.p
% 27.80/12.30
% 27.80/12.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 27.80/12.30
% 27.80/12.30 % ------ iProver source info
% 27.80/12.30
% 27.80/12.30 % git: date: 2026-07-19 20:42:38 +0200
% 27.80/12.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 27.80/12.30 % git: non_committed_changes: false
% 27.80/12.30
% 27.80/12.30 % ------ Parsing...
% 27.80/12.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 27.80/12.30
% 27.80/12.30 % ------ 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 %
% 27.80/12.30
% 27.80/12.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 27.80/12.30
% 27.80/12.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 27.80/12.30 % ------ Proving...
% 27.80/12.30 % ------ Problem Properties
% 27.80/12.30
% 27.80/12.30 %
% 27.80/12.30 % clauses 22
% 27.80/12.30 % conjectures 1
% 27.80/12.30 % EPR 5
% 27.80/12.30 % Horn 18
% 27.80/12.30 % unary 6
% 27.80/12.30 % binary 9
% 27.80/12.30 % lits 46
% 27.80/12.30 % lits eq 7
% 27.80/12.30 % fd_pure 0
% 27.80/12.30 % fd_pseudo 0
% 27.80/12.30 % fd_cond 0
% 27.80/12.30 % fd_pseudo_cond 5
% 27.80/12.30 % AC symbols 0
% 27.80/12.30
% 27.80/12.30 % ------ Input Options Time Limit: Unbounded
% 27.80/12.30
% 27.80/12.30
% 27.80/12.30 % ------
% 27.80/12.30 % Current options:
% 27.80/12.30 % ------
% 27.80/12.30
% 27.80/12.30
% 27.80/12.30 %
% 27.80/12.30
% 27.80/12.30 % ------ Proving...
% 27.80/12.30 %
% 27.80/12.30
% 27.80/12.30 % SZS status Theorem for theBenchmark.p
% 27.80/12.30
% 27.80/12.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 27.80/12.30
% 27.80/12.30
%------------------------------------------------------------------------------