TSTP Solution File: SET957+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET957+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:02:06 EDT 2024
% Result : Theorem 4.03s 1.21s
% Output : CNFRefutation 4.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 57 ( 12 unt; 0 def)
% Number of atoms : 175 ( 47 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 173 ( 55 ~; 64 |; 42 &)
% ( 5 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 126 ( 0 sgn 80 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f8,axiom,
! [X0,X1,X2,X3] :
~ ( ! [X4,X5] :
~ ( ordered_pair(X4,X5) = X3
& in(X5,X2)
& in(X4,X1) )
& in(X3,X0)
& subset(X0,cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t103_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) )
& subset(X3,cartesian_product2(X4,X5))
& subset(X0,cartesian_product2(X1,X2)) )
=> X0 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t110_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) )
& subset(X3,cartesian_product2(X4,X5))
& subset(X0,cartesian_product2(X1,X2)) )
=> X0 = X3 ),
inference(negated_conjecture,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f14,plain,
! [X0,X1,X2,X3] :
( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X2)
& in(X4,X1) )
| ~ in(X3,X0)
| ~ subset(X0,cartesian_product2(X1,X2)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) )
& subset(X3,cartesian_product2(X4,X5))
& subset(X0,cartesian_product2(X1,X2)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f16,plain,
? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& ! [X6,X7] :
( in(ordered_pair(X6,X7),X0)
<=> in(ordered_pair(X6,X7),X3) )
& subset(X3,cartesian_product2(X4,X5))
& subset(X0,cartesian_product2(X1,X2)) ),
inference(flattening,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f22,plain,
! [X1,X2,X3] :
( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X2)
& in(X4,X1) )
=> ( ordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)) = X3
& in(sK3(X1,X2,X3),X2)
& in(sK2(X1,X2,X3),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1,X2,X3] :
( ( ordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)) = X3
& in(sK3(X1,X2,X3),X2)
& in(sK2(X1,X2,X3),X1) )
| ~ in(X3,X0)
| ~ subset(X0,cartesian_product2(X1,X2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f14,f22]) ).
fof(f24,plain,
? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& ! [X6,X7] :
( ( in(ordered_pair(X6,X7),X0)
| ~ in(ordered_pair(X6,X7),X3) )
& ( in(ordered_pair(X6,X7),X3)
| ~ in(ordered_pair(X6,X7),X0) ) )
& subset(X3,cartesian_product2(X4,X5))
& subset(X0,cartesian_product2(X1,X2)) ),
inference(nnf_transformation,[],[f16]) ).
fof(f25,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( X0 != X3
& ! [X6,X7] :
( ( in(ordered_pair(X6,X7),X0)
| ~ in(ordered_pair(X6,X7),X3) )
& ( in(ordered_pair(X6,X7),X3)
| ~ in(ordered_pair(X6,X7),X0) ) )
& subset(X3,cartesian_product2(X4,X5))
& subset(X0,cartesian_product2(X1,X2)) )
=> ( sK4 != sK7
& ! [X7,X6] :
( ( in(ordered_pair(X6,X7),sK4)
| ~ in(ordered_pair(X6,X7),sK7) )
& ( in(ordered_pair(X6,X7),sK7)
| ~ in(ordered_pair(X6,X7),sK4) ) )
& subset(sK7,cartesian_product2(sK8,sK9))
& subset(sK4,cartesian_product2(sK5,sK6)) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( sK4 != sK7
& ! [X6,X7] :
( ( in(ordered_pair(X6,X7),sK4)
| ~ in(ordered_pair(X6,X7),sK7) )
& ( in(ordered_pair(X6,X7),sK7)
| ~ in(ordered_pair(X6,X7),sK4) ) )
& subset(sK7,cartesian_product2(sK8,sK9))
& subset(sK4,cartesian_product2(sK5,sK6)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9])],[f24,f25]) ).
fof(f27,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK10(X0,X1),X1)
| ~ in(sK10(X0,X1),X0) )
& ( in(sK10(X0,X1),X1)
| in(sK10(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK10(X0,X1),X1)
| ~ in(sK10(X0,X1),X0) )
& ( in(sK10(X0,X1),X1)
| in(sK10(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f27,f28]) ).
fof(f32,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)) = X3
| ~ in(X3,X0)
| ~ subset(X0,cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
subset(sK4,cartesian_product2(sK5,sK6)),
inference(cnf_transformation,[],[f26]) ).
fof(f41,plain,
subset(sK7,cartesian_product2(sK8,sK9)),
inference(cnf_transformation,[],[f26]) ).
fof(f42,plain,
! [X6,X7] :
( in(ordered_pair(X6,X7),sK7)
| ~ in(ordered_pair(X6,X7),sK4) ),
inference(cnf_transformation,[],[f26]) ).
fof(f43,plain,
! [X6,X7] :
( in(ordered_pair(X6,X7),sK4)
| ~ in(ordered_pair(X6,X7),sK7) ),
inference(cnf_transformation,[],[f26]) ).
fof(f44,plain,
sK4 != sK7,
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( X0 = X1
| in(sK10(X0,X1),X1)
| in(sK10(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f46,plain,
! [X0,X1] :
( X0 = X1
| ~ in(sK10(X0,X1),X1)
| ~ in(sK10(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
! [X2,X3,X0,X1] :
( unordered_pair(unordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)),singleton(sK2(X1,X2,X3))) = X3
| ~ in(X3,X0)
| ~ subset(X0,cartesian_product2(X1,X2)) ),
inference(definition_unfolding,[],[f39,f32]) ).
fof(f49,plain,
! [X6,X7] :
( in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK4)
| ~ in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK7) ),
inference(definition_unfolding,[],[f43,f32,f32]) ).
fof(f50,plain,
! [X6,X7] :
( in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK7)
| ~ in(unordered_pair(unordered_pair(X6,X7),singleton(X6)),sK4) ),
inference(definition_unfolding,[],[f42,f32,f32]) ).
cnf(c_55,plain,
( ~ subset(X0,cartesian_product2(X1,X2))
| ~ in(X3,X0)
| unordered_pair(unordered_pair(sK2(X1,X2,X3),sK3(X1,X2,X3)),singleton(sK2(X1,X2,X3))) = X3 ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_58,negated_conjecture,
sK4 != sK7,
inference(cnf_transformation,[],[f44]) ).
cnf(c_59,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK7)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK4) ),
inference(cnf_transformation,[],[f49]) ).
cnf(c_60,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK4)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK7) ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_61,negated_conjecture,
subset(sK7,cartesian_product2(sK8,sK9)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_62,negated_conjecture,
subset(sK4,cartesian_product2(sK5,sK6)),
inference(cnf_transformation,[],[f40]) ).
cnf(c_63,plain,
( ~ in(sK10(X0,X1),X0)
| ~ in(sK10(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_64,plain,
( X0 = X1
| in(sK10(X0,X1),X0)
| in(sK10(X0,X1),X1) ),
inference(cnf_transformation,[],[f45]) ).
cnf(c_715,plain,
( sK4 = sK7
| in(sK10(sK4,sK7),sK4)
| in(sK10(sK4,sK7),sK7) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_726,plain,
( ~ in(sK10(sK4,sK7),sK4)
| ~ in(sK10(sK4,sK7),sK7) ),
inference(resolution,[status(thm)],[c_63,c_58]) ).
cnf(c_1039,plain,
( ~ in(X0,sK7)
| unordered_pair(unordered_pair(sK2(sK8,sK9,X0),sK3(sK8,sK9,X0)),singleton(sK2(sK8,sK9,X0))) = X0 ),
inference(superposition,[status(thm)],[c_61,c_55]) ).
cnf(c_1040,plain,
( ~ in(X0,sK4)
| unordered_pair(unordered_pair(sK2(sK5,sK6,X0),sK3(sK5,sK6,X0)),singleton(sK2(sK5,sK6,X0))) = X0 ),
inference(superposition,[status(thm)],[c_62,c_55]) ).
cnf(c_1045,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(X0,sK7)),sK3(sK8,sK9,sK10(X0,sK7))),singleton(sK2(sK8,sK9,sK10(X0,sK7)))) = sK10(X0,sK7)
| X0 = sK7
| in(sK10(X0,sK7),X0) ),
inference(superposition,[status(thm)],[c_64,c_1039]) ).
cnf(c_1050,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| sK4 = sK7
| in(sK10(sK4,sK7),sK4) ),
inference(instantiation,[status(thm)],[c_1045]) ).
cnf(c_1165,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| unordered_pair(unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))),singleton(sK2(sK5,sK6,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| sK4 = sK7 ),
inference(superposition,[status(thm)],[c_1045,c_1040]) ).
cnf(c_1304,plain,
( unordered_pair(unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))),singleton(sK2(sK5,sK6,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7) ),
inference(global_subsumption_just,[status(thm)],[c_1165,c_58,c_1165]) ).
cnf(c_1305,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| unordered_pair(unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))),singleton(sK2(sK5,sK6,sK10(sK4,sK7)))) = sK10(sK4,sK7) ),
inference(renaming,[status(thm)],[c_1304]) ).
cnf(c_1308,plain,
( ~ in(sK10(sK4,sK7),sK4)
| unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| in(unordered_pair(unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))),singleton(sK2(sK5,sK6,sK10(sK4,sK7)))),sK7) ),
inference(superposition,[status(thm)],[c_1305,c_60]) ).
cnf(c_1310,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| in(unordered_pair(unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))),singleton(sK2(sK5,sK6,sK10(sK4,sK7)))),sK7) ),
inference(global_subsumption_just,[status(thm)],[c_1308,c_58,c_1050,c_1308]) ).
cnf(c_1312,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| in(sK10(sK4,sK7),sK7) ),
inference(superposition,[status(thm)],[c_1305,c_1310]) ).
cnf(c_1314,plain,
( unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7)
| in(unordered_pair(unordered_pair(sK2(sK5,sK6,sK10(sK4,sK7)),sK3(sK5,sK6,sK10(sK4,sK7))),singleton(sK2(sK5,sK6,sK10(sK4,sK7)))),sK4) ),
inference(superposition,[status(thm)],[c_1310,c_59]) ).
cnf(c_1315,plain,
unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))) = sK10(sK4,sK7),
inference(global_subsumption_just,[status(thm)],[c_1314,c_58,c_726,c_1050,c_1312]) ).
cnf(c_1319,plain,
( ~ in(sK10(sK4,sK7),sK4)
| in(unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))),sK7) ),
inference(superposition,[status(thm)],[c_1315,c_60]) ).
cnf(c_1320,plain,
( ~ in(sK10(sK4,sK7),sK7)
| in(unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))),sK4) ),
inference(superposition,[status(thm)],[c_1315,c_59]) ).
cnf(c_1498,plain,
( ~ in(sK10(sK4,sK7),sK4)
| in(sK10(sK4,sK7),sK7) ),
inference(superposition,[status(thm)],[c_1315,c_1319]) ).
cnf(c_1579,plain,
in(unordered_pair(unordered_pair(sK2(sK8,sK9,sK10(sK4,sK7)),sK3(sK8,sK9,sK10(sK4,sK7))),singleton(sK2(sK8,sK9,sK10(sK4,sK7)))),sK4),
inference(global_subsumption_just,[status(thm)],[c_1320,c_58,c_715,c_726,c_1320,c_1498]) ).
cnf(c_1583,plain,
in(sK10(sK4,sK7),sK4),
inference(superposition,[status(thm)],[c_1315,c_1579]) ).
cnf(c_1586,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1583,c_1498,c_726]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET957+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 20:16:17 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.03/1.21 % SZS status Started for theBenchmark.p
% 4.03/1.21 % SZS status Theorem for theBenchmark.p
% 4.03/1.21
% 4.03/1.21 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.03/1.21
% 4.03/1.21 ------ iProver source info
% 4.03/1.21
% 4.03/1.21 git: date: 2024-05-02 19:28:25 +0000
% 4.03/1.21 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.03/1.21 git: non_committed_changes: false
% 4.03/1.21
% 4.03/1.21 ------ Parsing...
% 4.03/1.21 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.03/1.21
% 4.03/1.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.03/1.21
% 4.03/1.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.03/1.21
% 4.03/1.21 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.03/1.21 ------ Proving...
% 4.03/1.21 ------ Problem Properties
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 clauses 16
% 4.03/1.21 conjectures 5
% 4.03/1.21 EPR 5
% 4.03/1.21 Horn 15
% 4.03/1.21 unary 8
% 4.03/1.21 binary 3
% 4.03/1.21 lits 29
% 4.03/1.21 lits eq 5
% 4.03/1.21 fd_pure 0
% 4.03/1.21 fd_pseudo 0
% 4.03/1.21 fd_cond 0
% 4.03/1.21 fd_pseudo_cond 2
% 4.03/1.21 AC symbols 0
% 4.03/1.21
% 4.03/1.21 ------ Input Options Time Limit: Unbounded
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 ------
% 4.03/1.21 Current options:
% 4.03/1.21 ------
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 ------ Proving...
% 4.03/1.21
% 4.03/1.21
% 4.03/1.21 % SZS status Theorem for theBenchmark.p
% 4.03/1.21
% 4.03/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.03/1.22
% 4.03/1.22
%------------------------------------------------------------------------------