TSTP Solution File: SEU131+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU131+2 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Mon Jun 24 15:16:37 EDT 2024
% Result : Theorem 0.48s 1.14s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f6,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] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,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(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f20,conjecture,
! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(f21,negated_conjecture,
~ ! [X0,X1] :
( empty_set = set_difference(X0,X1)
<=> subset(X0,X1) ),
inference(negated_conjecture,[],[f20]) ).
fof(f26,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f32,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f52,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f55,plain,
? [X0,X1] :
( empty_set = set_difference(X0,X1)
<~> subset(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f57,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f63,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f32]) ).
fof(f75,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f76,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f75]) ).
fof(f77,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f78,plain,
! [X0] :
( ( empty_set = X0
| in(sK0(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f76,f77]) ).
fof(f79,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,[],[f6]) ).
fof(f80,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,[],[f79]) ).
fof(f81,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,[],[f80]) ).
fof(f82,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(f83,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])],[f81,f82]) ).
fof(f84,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,[],[f52]) ).
fof(f85,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,[],[f84]) ).
fof(f86,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f85,f86]) ).
fof(f93,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,[],[f9]) ).
fof(f94,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,[],[f93]) ).
fof(f95,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,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( ~ in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ( ( in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( ~ in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(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,[sK4])],[f95,f96]) ).
fof(f98,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set )
& ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f99,plain,
? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) ),
inference(nnf_transformation,[],[f55]) ).
fof(f100,plain,
( ? [X0,X1] :
( ( ~ subset(X0,X1)
| empty_set != set_difference(X0,X1) )
& ( subset(X0,X1)
| empty_set = set_difference(X0,X1) ) )
=> ( ( ~ subset(sK5,sK6)
| empty_set != set_difference(sK5,sK6) )
& ( subset(sK5,sK6)
| empty_set = set_difference(sK5,sK6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
( ( ~ subset(sK5,sK6)
| empty_set != set_difference(sK5,sK6) )
& ( subset(sK5,sK6)
| empty_set = set_difference(sK5,sK6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f99,f100]) ).
fof(f119,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f78]) ).
fof(f120,plain,
! [X0] :
( empty_set = X0
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f78]) ).
fof(f122,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f83]) ).
fof(f128,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f87]) ).
fof(f129,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f87]) ).
fof(f136,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f97]) ).
fof(f137,plain,
! [X2,X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X2)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f97]) ).
fof(f138,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f97]) ).
fof(f143,plain,
! [X0,X1] :
( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ),
inference(cnf_transformation,[],[f98]) ).
fof(f149,plain,
( subset(sK5,sK6)
| empty_set = set_difference(sK5,sK6) ),
inference(cnf_transformation,[],[f101]) ).
fof(f150,plain,
( ~ subset(sK5,sK6)
| empty_set != set_difference(sK5,sK6) ),
inference(cnf_transformation,[],[f101]) ).
fof(f155,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f161,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
fof(f181,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f119]) ).
fof(f183,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f122]) ).
fof(f188,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f138]) ).
fof(f189,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f137]) ).
fof(f190,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_difference(X0,X1)) ),
inference(equality_resolution,[],[f136]) ).
cnf(c_55,plain,
( X0 = empty_set
| in(sK0(X0),X0) ),
inference(cnf_transformation,[],[f120]) ).
cnf(c_56,plain,
~ in(X0,empty_set),
inference(cnf_transformation,[],[f181]) ).
cnf(c_61,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X1,X2)) ),
inference(cnf_transformation,[],[f183]) ).
cnf(c_63,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f129]) ).
cnf(c_64,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_75,plain,
( ~ in(X0,X1)
| in(X0,set_difference(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f188]) ).
cnf(c_76,plain,
( ~ in(X0,set_difference(X1,X2))
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f189]) ).
cnf(c_77,plain,
( ~ in(X0,set_difference(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f190]) ).
cnf(c_78,plain,
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_85,negated_conjecture,
( set_difference(sK5,sK6) != empty_set
| ~ subset(sK5,sK6) ),
inference(cnf_transformation,[],[f150]) ).
cnf(c_86,negated_conjecture,
( set_difference(sK5,sK6) = empty_set
| subset(sK5,sK6) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_91,plain,
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f155]) ).
cnf(c_97,plain,
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f161]) ).
cnf(c_1567,plain,
set_difference(sK5,sK6) = sP0_iProver_def,
definition ).
cnf(c_1568,negated_conjecture,
( sP0_iProver_def = empty_set
| subset(sK5,sK6) ),
inference(demodulation,[status(thm)],[c_86,c_1567]) ).
cnf(c_1569,negated_conjecture,
( sP0_iProver_def != empty_set
| ~ subset(sK5,sK6) ),
inference(demodulation,[status(thm)],[c_85]) ).
cnf(c_2891,plain,
( ~ in(X0,sP0_iProver_def)
| in(X0,sK5) ),
inference(superposition,[status(thm)],[c_1567,c_77]) ).
cnf(c_2916,plain,
( ~ in(X0,sK6)
| ~ in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1567,c_76]) ).
cnf(c_2937,plain,
( empty_set = sP0_iProver_def
| in(sK0(sP0_iProver_def),sK5) ),
inference(superposition,[status(thm)],[c_55,c_2891]) ).
cnf(c_2956,plain,
( ~ in(sK0(sP0_iProver_def),sK6)
| empty_set = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_55,c_2916]) ).
cnf(c_3140,plain,
( set_union2(sK5,sK6) = sK6
| empty_set = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_1568,c_91]) ).
cnf(c_3172,plain,
( set_intersection2(sK5,sK6) = sK5
| empty_set = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_1568,c_97]) ).
cnf(c_3234,plain,
( ~ in(X0,sK5)
| empty_set = sP0_iProver_def
| in(X0,sK6) ),
inference(superposition,[status(thm)],[c_3140,c_61]) ).
cnf(c_3248,plain,
( empty_set != sK5
| empty_set = sP0_iProver_def
| disjoint(sK5,sK6) ),
inference(superposition,[status(thm)],[c_3172,c_78]) ).
cnf(c_3284,plain,
( empty_set = sP0_iProver_def
| in(sK0(sP0_iProver_def),sK6) ),
inference(superposition,[status(thm)],[c_2937,c_3234]) ).
cnf(c_3330,plain,
empty_set = sP0_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_3248,c_2956,c_3284]) ).
cnf(c_3353,plain,
~ in(X0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_56,c_3330]) ).
cnf(c_3356,plain,
( sP0_iProver_def != sP0_iProver_def
| ~ subset(sK5,sK6) ),
inference(demodulation,[status(thm)],[c_1569,c_3330]) ).
cnf(c_3366,plain,
~ subset(sK5,sK6),
inference(equality_resolution_simp,[status(thm)],[c_3356]) ).
cnf(c_3659,plain,
( ~ in(X0,sK5)
| in(X0,sK6)
| in(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1567,c_75]) ).
cnf(c_3668,plain,
( ~ in(X0,sK5)
| in(X0,sK6) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3659,c_3353]) ).
cnf(c_3719,plain,
( in(sK2(sK5,X0),sK6)
| subset(sK5,X0) ),
inference(superposition,[status(thm)],[c_64,c_3668]) ).
cnf(c_6835,plain,
subset(sK5,sK6),
inference(superposition,[status(thm)],[c_3719,c_63]) ).
cnf(c_6836,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6835,c_3366]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU131+2 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 11:48:39 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.48/1.14 % SZS status Started for theBenchmark.p
% 0.48/1.14 % SZS status Theorem for theBenchmark.p
% 0.48/1.14
% 0.48/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.14
% 0.48/1.14 ------ iProver source info
% 0.48/1.14
% 0.48/1.14 git: date: 2024-06-12 09:56:46 +0000
% 0.48/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.48/1.14 git: non_committed_changes: false
% 0.48/1.14
% 0.48/1.14 ------ Parsing...
% 0.48/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.14
% 0.48/1.14 ------ 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
% 0.48/1.14
% 0.48/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.14
% 0.48/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.14 ------ Proving...
% 0.48/1.14 ------ Problem Properties
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 clauses 65
% 0.48/1.14 conjectures 2
% 0.48/1.14 EPR 18
% 0.48/1.14 Horn 50
% 0.48/1.14 unary 17
% 0.48/1.14 binary 27
% 0.48/1.14 lits 137
% 0.48/1.14 lits eq 31
% 0.48/1.14 fd_pure 0
% 0.48/1.14 fd_pseudo 0
% 0.48/1.14 fd_cond 3
% 0.48/1.14 fd_pseudo_cond 13
% 0.48/1.14 AC symbols 0
% 0.48/1.14
% 0.48/1.14 ------ Schedule dynamic 5 is on
% 0.48/1.14
% 0.48/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 ------
% 0.48/1.14 Current options:
% 0.48/1.14 ------
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 ------ Proving...
% 0.48/1.14
% 0.48/1.14
% 0.48/1.14 % SZS status Theorem for theBenchmark.p
% 0.48/1.14
% 0.48/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.14
% 0.48/1.14
%------------------------------------------------------------------------------