TSTP Solution File: SEU131+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU131+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:04:36 EDT 2024
% Result : Theorem 3.53s 1.12s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f3,axiom,
! [X0,X1,X2] :
( set_difference(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f6,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f7,conjecture,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
inference(negated_conjecture,[],[f7]) ).
fof(f12,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f13,axiom,
! [X0] : set_difference(X0,empty_set) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_boole) ).
fof(f14,axiom,
! [X0] : empty_set = set_difference(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_boole) ).
fof(f15,axiom,
! [X0] :
( empty(X0)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f16,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f21,plain,
? [X0,X1] :
( set_difference(X0,X1) = empty_set
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f22,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f23,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f26,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f27,f28]) ).
fof(f30,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,[],[f3]) ).
fof(f31,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,[],[f30]) ).
fof(f32,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,[],[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_difference(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_difference(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f32,f33]) ).
fof(f35,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| set_difference(X0,X1) != empty_set )
& ( subset(X0,X1)
| set_difference(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f36,plain,
( ? [X0,X1] :
( ( ~ subset(X0,X1)
| set_difference(X0,X1) != empty_set )
& ( subset(X0,X1)
| set_difference(X0,X1) = empty_set ) )
=> ( ( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) )
& ( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( ( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) )
& ( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f35,f36]) ).
fof(f42,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) )
& ( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f44,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK6(X0,X1),X1)
| ~ in(sK6(X0,X1),X0) )
& ( in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f42,f43]) ).
fof(f46,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f47,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f49,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f34]) ).
fof(f50,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f34]) ).
fof(f51,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f34]) ).
fof(f55,plain,
empty(empty_set),
inference(cnf_transformation,[],[f6]) ).
fof(f56,plain,
( subset(sK2,sK3)
| empty_set = set_difference(sK2,sK3) ),
inference(cnf_transformation,[],[f37]) ).
fof(f57,plain,
( ~ subset(sK2,sK3)
| empty_set != set_difference(sK2,sK3) ),
inference(cnf_transformation,[],[f37]) ).
fof(f61,plain,
! [X0,X1] :
( X0 = X1
| in(sK6(X0,X1),X1)
| in(sK6(X0,X1),X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f63,plain,
! [X0] : set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f13]) ).
fof(f64,plain,
! [X0] : empty_set = set_difference(empty_set,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f65,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f66,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f68,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f51]) ).
fof(f69,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f50]) ).
fof(f70,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f49]) ).
cnf(c_50,plain,
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_51,plain,
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_52,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_56,plain,
( ~ in(X0,X1)
| in(X0,set_difference(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_57,plain,
( ~ in(X0,set_difference(X1,X2))
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_58,plain,
( ~ in(X0,set_difference(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_59,plain,
empty(empty_set),
inference(cnf_transformation,[],[f55]) ).
cnf(c_60,negated_conjecture,
( set_difference(sK2,sK3) != empty_set
| ~ subset(sK2,sK3) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_61,negated_conjecture,
( set_difference(sK2,sK3) = empty_set
| subset(sK2,sK3) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_66,plain,
( X0 = X1
| in(sK6(X0,X1),X0)
| in(sK6(X0,X1),X1) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_67,plain,
set_difference(X0,empty_set) = X0,
inference(cnf_transformation,[],[f63]) ).
cnf(c_68,plain,
set_difference(empty_set,X0) = empty_set,
inference(cnf_transformation,[],[f64]) ).
cnf(c_69,plain,
( ~ empty(X0)
| X0 = empty_set ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_70,plain,
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_75,plain,
( ~ empty(empty_set)
| empty_set = empty_set ),
inference(instantiation,[status(thm)],[c_69]) ).
cnf(c_82,plain,
( subset(sK2,sK3)
| set_difference(sK2,sK3) = empty_set ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_83,plain,
( set_difference(sK2,sK3) = empty_set
| subset(sK2,sK3) ),
inference(renaming,[status(thm)],[c_82]) ).
cnf(c_378,plain,
( X0 != sK2
| X1 != sK3
| ~ in(X2,X0)
| set_difference(sK2,sK3) = empty_set
| in(X2,X1) ),
inference(resolution_lifted,[status(thm)],[c_52,c_83]) ).
cnf(c_379,plain,
( ~ in(X0,sK2)
| set_difference(sK2,sK3) = empty_set
| in(X0,sK3) ),
inference(unflattening,[status(thm)],[c_378]) ).
cnf(c_415,plain,
set_difference(sK2,sK3) = sP0_iProver_def,
definition ).
cnf(c_416,negated_conjecture,
( sP0_iProver_def = empty_set
| subset(sK2,sK3) ),
inference(demodulation,[status(thm)],[c_61,c_415]) ).
cnf(c_417,negated_conjecture,
( sP0_iProver_def != empty_set
| ~ subset(sK2,sK3) ),
inference(demodulation,[status(thm)],[c_60]) ).
cnf(c_420,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_424,plain,
( X0 != X1
| ~ empty(X1)
| empty(X0) ),
theory(equality) ).
cnf(c_910,plain,
( ~ in(X0,sP0_iProver_def)
| in(X0,sK2) ),
inference(superposition,[status(thm)],[c_415,c_58]) ).
cnf(c_957,plain,
( ~ in(X0,sK3)
| ~ in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_415,c_57]) ).
cnf(c_958,plain,
( ~ in(X0,X1)
| ~ in(X0,empty_set) ),
inference(superposition,[status(thm)],[c_67,c_57]) ).
cnf(c_1004,plain,
( ~ in(X0,sK2)
| in(X0,sK3)
| in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_415,c_56]) ).
cnf(c_1009,plain,
( ~ empty(set_difference(X0,X1))
| ~ in(X2,X0)
| in(X2,X1) ),
inference(superposition,[status(thm)],[c_56,c_70]) ).
cnf(c_1104,plain,
( sP0_iProver_def = empty_set
| in(sK6(sP0_iProver_def,empty_set),empty_set)
| in(sK6(sP0_iProver_def,empty_set),sP0_iProver_def) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_1318,plain,
( sP0_iProver_def != X0
| ~ empty(X0)
| empty(sP0_iProver_def) ),
inference(instantiation,[status(thm)],[c_424]) ).
cnf(c_1319,plain,
( sP0_iProver_def != empty_set
| ~ empty(empty_set)
| empty(sP0_iProver_def) ),
inference(instantiation,[status(thm)],[c_1318]) ).
cnf(c_1323,plain,
( ~ in(sK6(sP0_iProver_def,empty_set),sP0_iProver_def)
| ~ subset(sP0_iProver_def,X0)
| in(sK6(sP0_iProver_def,empty_set),X0) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_1324,plain,
( ~ in(sK6(sP0_iProver_def,empty_set),sP0_iProver_def)
| ~ subset(sP0_iProver_def,empty_set)
| in(sK6(sP0_iProver_def,empty_set),empty_set) ),
inference(instantiation,[status(thm)],[c_1323]) ).
cnf(c_1715,plain,
( ~ in(sK6(sP0_iProver_def,empty_set),empty_set)
| ~ empty(empty_set) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_1788,plain,
( ~ in(X0,sK2)
| ~ empty(sP0_iProver_def)
| in(X0,sK3) ),
inference(superposition,[status(thm)],[c_415,c_1009]) ).
cnf(c_1790,plain,
( ~ in(X0,empty_set)
| ~ empty(empty_set)
| in(X0,X1) ),
inference(superposition,[status(thm)],[c_68,c_1009]) ).
cnf(c_1791,plain,
( ~ in(X0,empty_set)
| in(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1790,c_59]) ).
cnf(c_1807,plain,
( ~ in(X0,sK3)
| ~ in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_415,c_57]) ).
cnf(c_1816,plain,
~ in(X0,empty_set),
inference(global_subsumption_just,[status(thm)],[c_1791,c_958,c_1791]) ).
cnf(c_1821,plain,
( X0 = empty_set
| in(sK6(X0,empty_set),X0) ),
inference(superposition,[status(thm)],[c_66,c_1816]) ).
cnf(c_1840,plain,
( empty_set != X0
| sP0_iProver_def != X0
| empty_set = sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_420]) ).
cnf(c_1841,plain,
( empty_set != empty_set
| sP0_iProver_def != empty_set
| empty_set = sP0_iProver_def ),
inference(instantiation,[status(thm)],[c_1840]) ).
cnf(c_1854,plain,
( empty_set = sP0_iProver_def
| in(sK6(sP0_iProver_def,empty_set),sK2) ),
inference(superposition,[status(thm)],[c_1821,c_910]) ).
cnf(c_1872,plain,
~ in(X0,sP0_iProver_def),
inference(global_subsumption_just,[status(thm)],[c_1807,c_59,c_60,c_379,c_416,c_910,c_957,c_1319,c_1788]) ).
cnf(c_1875,plain,
subset(sP0_iProver_def,X0),
inference(superposition,[status(thm)],[c_51,c_1872]) ).
cnf(c_1876,plain,
subset(sP0_iProver_def,empty_set),
inference(instantiation,[status(thm)],[c_1875]) ).
cnf(c_1980,plain,
empty_set = sP0_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_1854,c_59,c_75,c_1104,c_1324,c_1715,c_1841,c_1876]) ).
cnf(c_1984,plain,
~ in(X0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_1816,c_1980]) ).
cnf(c_1993,plain,
( sP0_iProver_def != sP0_iProver_def
| ~ subset(sK2,sK3) ),
inference(demodulation,[status(thm)],[c_417,c_1980]) ).
cnf(c_1999,plain,
~ subset(sK2,sK3),
inference(equality_resolution_simp,[status(thm)],[c_1993]) ).
cnf(c_2004,plain,
( ~ in(X0,sK2)
| in(X0,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1004,c_1984]) ).
cnf(c_2087,plain,
( in(sK0(sK2,X0),sK3)
| subset(sK2,X0) ),
inference(superposition,[status(thm)],[c_51,c_2004]) ).
cnf(c_2126,plain,
subset(sK2,sK3),
inference(superposition,[status(thm)],[c_2087,c_50]) ).
cnf(c_2127,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2126,c_1999]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU131+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 17:56:02 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 3.53/1.12 % SZS status Started for theBenchmark.p
% 3.53/1.12 % SZS status Theorem for theBenchmark.p
% 3.53/1.12
% 3.53/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.53/1.12
% 3.53/1.12 ------ iProver source info
% 3.53/1.12
% 3.53/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.53/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.53/1.12 git: non_committed_changes: false
% 3.53/1.12
% 3.53/1.12 ------ Parsing...
% 3.53/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.53/1.12
% 3.53/1.12 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.53/1.12
% 3.53/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.53/1.12
% 3.53/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.53/1.12 ------ Proving...
% 3.53/1.12 ------ Problem Properties
% 3.53/1.12
% 3.53/1.12
% 3.53/1.12 clauses 24
% 3.53/1.12 conjectures 2
% 3.53/1.12 EPR 11
% 3.53/1.12 Horn 17
% 3.53/1.12 unary 7
% 3.53/1.12 binary 9
% 3.53/1.12 lits 50
% 3.53/1.12 lits eq 12
% 3.53/1.12 fd_pure 0
% 3.53/1.12 fd_pseudo 0
% 3.53/1.12 fd_cond 1
% 3.53/1.12 fd_pseudo_cond 6
% 3.53/1.12 AC symbols 0
% 3.53/1.12
% 3.53/1.12 ------ Schedule dynamic 5 is on
% 3.53/1.12
% 3.53/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.53/1.12
% 3.53/1.12
% 3.53/1.12 ------
% 3.53/1.12 Current options:
% 3.53/1.12 ------
% 3.53/1.12
% 3.53/1.12
% 3.53/1.12
% 3.53/1.12
% 3.53/1.12 ------ Proving...
% 3.53/1.12
% 3.53/1.12
% 3.53/1.12 % SZS status Theorem for theBenchmark.p
% 3.53/1.12
% 3.53/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.53/1.12
% 3.53/1.13
%------------------------------------------------------------------------------