TSTP Solution File: SET986+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET986+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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 : Thu Aug 31 15:10:56 EDT 2023
% Result : Theorem 3.85s 1.15s
% Output : CNFRefutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 12 unt; 0 def)
% Number of atoms : 302 ( 84 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 379 ( 143 ~; 160 |; 64 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 148 ( 2 sgn; 102 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f5,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f7,axiom,
! [X0,X1,X2] :
( set_difference(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f14,conjecture,
! [X0,X1] :
( in(X0,X1)
=> set_union2(set_difference(X1,singleton(X0)),singleton(X0)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t140_zfmisc_1) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> set_union2(set_difference(X1,singleton(X0)),singleton(X0)) = X1 ),
inference(negated_conjecture,[],[f14]) ).
fof(f23,plain,
? [X0,X1] :
( set_union2(set_difference(X1,singleton(X0)),singleton(X0)) != X1
& in(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f27,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f27,f28]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,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)
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = 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)
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f32,f33]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0) )
& ( ( ~ in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f40]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( ~ in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) )
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ( ( in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0)
| ~ in(sK3(X0,X1,X2),X2) )
& ( ( ~ in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) )
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0) )
& ( ( ~ in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f41,f42]) ).
fof(f48,plain,
( ? [X0,X1] :
( set_union2(set_difference(X1,singleton(X0)),singleton(X0)) != X1
& in(X0,X1) )
=> ( sK7 != set_union2(set_difference(sK7,singleton(sK6)),singleton(sK6))
& in(sK6,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
( sK7 != set_union2(set_difference(sK7,singleton(sK6)),singleton(sK6))
& in(sK6,sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f23,f48]) ).
fof(f53,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f57,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f58,plain,
! [X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f64,plain,
! [X2,X0,X1] :
( set_union2(X0,X1) = X2
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f65,plain,
! [X2,X0,X1] :
( set_union2(X0,X1) = X2
| ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f66,plain,
! [X2,X0,X1] :
( set_union2(X0,X1) = X2
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f72,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f43]) ).
fof(f82,plain,
in(sK6,sK7),
inference(cnf_transformation,[],[f49]) ).
fof(f83,plain,
sK7 != set_union2(set_difference(sK7,singleton(sK6)),singleton(sK6)),
inference(cnf_transformation,[],[f49]) ).
fof(f89,plain,
! [X3,X1] :
( in(X3,X1)
| singleton(X3) != X1 ),
inference(equality_resolution,[],[f58]) ).
fof(f90,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f89]) ).
fof(f91,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,singleton(X0)) ),
inference(equality_resolution,[],[f57]) ).
fof(f95,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f72]) ).
fof(f97,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f70]) ).
cnf(c_50,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f53]) ).
cnf(c_56,plain,
in(X0,singleton(X0)),
inference(cnf_transformation,[],[f90]) ).
cnf(c_57,plain,
( ~ in(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_58,plain,
( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2)
| set_union2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_59,plain,
( ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2)
| set_union2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_60,plain,
( set_union2(X0,X1) = X2
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_70,plain,
( ~ in(X0,X1)
| in(X0,set_difference(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f95]) ).
cnf(c_72,plain,
( ~ in(X0,set_difference(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_79,negated_conjecture,
set_union2(set_difference(sK7,singleton(sK6)),singleton(sK6)) != sK7,
inference(cnf_transformation,[],[f83]) ).
cnf(c_80,negated_conjecture,
in(sK6,sK7),
inference(cnf_transformation,[],[f82]) ).
cnf(c_238,plain,
set_union2(singleton(sK6),set_difference(sK7,singleton(sK6))) != sK7,
inference(demodulation,[status(thm)],[c_79,c_50]) ).
cnf(c_398,plain,
( X0 != X1
| X2 != X3
| ~ in(X1,X3)
| in(X0,X2) ),
theory(equality) ).
cnf(c_771,plain,
( set_union2(singleton(sK6),set_difference(sK7,singleton(sK6))) = sK7
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),set_difference(sK7,singleton(sK6)))
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),singleton(sK6))
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_772,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),set_difference(sK7,singleton(sK6)))
| ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7)
| set_union2(singleton(sK6),set_difference(sK7,singleton(sK6))) = sK7 ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_773,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),singleton(sK6))
| ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7)
| set_union2(singleton(sK6),set_difference(sK7,singleton(sK6))) = sK7 ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_779,plain,
( ~ in(sK7,singleton(X0))
| sK7 = X0 ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_802,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),set_difference(sK7,X0))
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7) ),
inference(instantiation,[status(thm)],[c_72]) ).
cnf(c_805,plain,
( sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7) != X0
| sK7 != X1
| ~ in(X0,X1)
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7) ),
inference(instantiation,[status(thm)],[c_398]) ).
cnf(c_859,plain,
( ~ in(sK7,singleton(sK7))
| sK7 = sK7 ),
inference(instantiation,[status(thm)],[c_779]) ).
cnf(c_908,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),X0)
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),set_difference(X0,singleton(sK6)))
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),singleton(sK6)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_969,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),singleton(X0))
| sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7) = X0 ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_970,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),singleton(sK6))
| sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7) = sK6 ),
inference(instantiation,[status(thm)],[c_969]) ).
cnf(c_1079,plain,
in(sK7,singleton(sK7)),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_1588,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),set_difference(sK7,singleton(sK6)))
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7) ),
inference(instantiation,[status(thm)],[c_802]) ).
cnf(c_3167,plain,
( sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7) != X0
| sK7 != sK7
| ~ in(X0,sK7)
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7) ),
inference(instantiation,[status(thm)],[c_805]) ).
cnf(c_3168,plain,
( sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7) != sK6
| sK7 != sK7
| ~ in(sK6,sK7)
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7) ),
inference(instantiation,[status(thm)],[c_3167]) ).
cnf(c_4284,plain,
( ~ in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),sK7)
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),set_difference(sK7,singleton(sK6)))
| in(sK1(singleton(sK6),set_difference(sK7,singleton(sK6)),sK7),singleton(sK6)) ),
inference(instantiation,[status(thm)],[c_908]) ).
cnf(c_5153,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4284,c_3168,c_1588,c_1079,c_970,c_859,c_771,c_772,c_773,c_238,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET986+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 08:55:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.85/1.15 % SZS status Started for theBenchmark.p
% 3.85/1.15 % SZS status Theorem for theBenchmark.p
% 3.85/1.15
% 3.85/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.85/1.15
% 3.85/1.15 ------ iProver source info
% 3.85/1.15
% 3.85/1.15 git: date: 2023-05-31 18:12:56 +0000
% 3.85/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.85/1.15 git: non_committed_changes: false
% 3.85/1.15 git: last_make_outside_of_git: false
% 3.85/1.15
% 3.85/1.15 ------ Parsing...
% 3.85/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.85/1.15
% 3.85/1.15 ------ Preprocessing... sup_sim: 1 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
% 3.85/1.15
% 3.85/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.85/1.15
% 3.85/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.85/1.15 ------ Proving...
% 3.85/1.15 ------ Problem Properties
% 3.85/1.15
% 3.85/1.15
% 3.85/1.15 clauses 32
% 3.85/1.15 conjectures 1
% 3.85/1.15 EPR 7
% 3.85/1.15 Horn 23
% 3.85/1.15 unary 9
% 3.85/1.15 binary 10
% 3.85/1.15 lits 70
% 3.85/1.15 lits eq 16
% 3.85/1.15 fd_pure 0
% 3.85/1.15 fd_pseudo 0
% 3.85/1.15 fd_cond 0
% 3.85/1.15 fd_pseudo_cond 10
% 3.85/1.15 AC symbols 0
% 3.85/1.15
% 3.85/1.15 ------ Input Options Time Limit: Unbounded
% 3.85/1.15
% 3.85/1.15
% 3.85/1.15 ------
% 3.85/1.15 Current options:
% 3.85/1.15 ------
% 3.85/1.15
% 3.85/1.15
% 3.85/1.15
% 3.85/1.15
% 3.85/1.15 ------ Proving...
% 3.85/1.15
% 3.85/1.15
% 3.85/1.15 % SZS status Theorem for theBenchmark.p
% 3.85/1.15
% 3.85/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.85/1.15
% 3.85/1.16
%------------------------------------------------------------------------------