TSTP Solution File: SEU325+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU325+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 17:05:49 EDT 2023
% Result : Theorem 3.41s 1.20s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 95 ( 32 unt; 0 def)
% Number of atoms : 271 ( 53 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 280 ( 104 ~; 90 |; 64 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 136 ( 7 sgn; 83 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0] :
( one_sorted_str(X0)
=> cast_as_carrier_subset(X0) = the_carrier(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(f18,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(f19,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_pre_topc) ).
fof(f29,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f30,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ~ empty(the_carrier(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(f33,axiom,
( v5_membered(empty_set)
& v4_membered(empty_set)
& v3_membered(empty_set)
& v2_membered(empty_set)
& v1_membered(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_membered) ).
fof(f36,axiom,
! [X0] :
? [X1] :
( empty(X1)
& element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(f39,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> union_of_subsets(X0,X1) = union(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(f42,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f46,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( empty_set = X1
& is_a_cover_of_carrier(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( empty_set = X1
& is_a_cover_of_carrier(X0,X1) ) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f48,axiom,
! [X0] :
( empty(X0)
=> empty_set = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(f49,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(f79,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f80,plain,
! [X0] :
( ! [X1] :
( ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) )
| ~ element(X1,powerset(powerset(the_carrier(X0)))) )
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f83,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f84,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f83]) ).
fof(f90,plain,
! [X0,X1] :
( union_of_subsets(X0,X1) = union(X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f39]) ).
fof(f92,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f93,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f92]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(X0,X1)
& element(X1,powerset(powerset(the_carrier(X0)))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(X0,X1)
& element(X1,powerset(powerset(the_carrier(X0)))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f101,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f103,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f104,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f103]) ).
fof(f105,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK0(X0,X1),X3) )
| ~ in(sK0(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK0(X0,X1),X4) )
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK0(X0,X1),X4) )
=> ( in(sK1(X0,X1),X0)
& in(sK0(X0,X1),sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f107,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK2(X0,X5),X0)
& in(X5,sK2(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK0(X0,X1),X3) )
| ~ in(sK0(X0,X1),X1) )
& ( ( in(sK1(X0,X1),X0)
& in(sK0(X0,X1),sK1(X0,X1)) )
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK2(X0,X5),X0)
& in(X5,sK2(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f104,f107,f106,f105]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ( ( is_a_cover_of_carrier(X0,X1)
| cast_as_carrier_subset(X0) != union_of_subsets(the_carrier(X0),X1) )
& ( cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1)
| ~ is_a_cover_of_carrier(X0,X1) ) )
| ~ element(X1,powerset(powerset(the_carrier(X0)))) )
| ~ one_sorted_str(X0) ),
inference(nnf_transformation,[],[f80]) ).
fof(f112,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
! [X0] : element(sK4(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f29,f112]) ).
fof(f118,plain,
! [X0] :
( ? [X1] :
( empty(X1)
& element(X1,powerset(X0)) )
=> ( empty(sK7(X0))
& element(sK7(X0),powerset(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X0] :
( empty(sK7(X0))
& element(sK7(X0),powerset(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f36,f118]) ).
fof(f124,plain,
( ? [X0] :
( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(X0,X1)
& element(X1,powerset(powerset(the_carrier(X0)))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(sK10,X1)
& element(X1,powerset(powerset(the_carrier(sK10)))) )
& one_sorted_str(sK10)
& ~ empty_carrier(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(sK10,X1)
& element(X1,powerset(powerset(the_carrier(sK10)))) )
=> ( empty_set = sK11
& is_a_cover_of_carrier(sK10,sK11)
& element(sK11,powerset(powerset(the_carrier(sK10)))) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( empty_set = sK11
& is_a_cover_of_carrier(sK10,sK11)
& element(sK11,powerset(powerset(the_carrier(sK10))))
& one_sorted_str(sK10)
& ~ empty_carrier(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f99,f125,f124]) ).
fof(f152,plain,
! [X0] :
( cast_as_carrier_subset(X0) = the_carrier(X0)
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f154,plain,
! [X0,X1,X5] :
( in(sK2(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f108]) ).
fof(f159,plain,
! [X0,X1] :
( cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1)
| ~ is_a_cover_of_carrier(X0,X1)
| ~ element(X1,powerset(powerset(the_carrier(X0))))
| ~ one_sorted_str(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f164,plain,
! [X0] : element(sK4(X0),X0),
inference(cnf_transformation,[],[f113]) ).
fof(f165,plain,
! [X0] :
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f84]) ).
fof(f168,plain,
empty(empty_set),
inference(cnf_transformation,[],[f33]) ).
fof(f182,plain,
! [X0] : element(sK7(X0),powerset(X0)),
inference(cnf_transformation,[],[f119]) ).
fof(f183,plain,
! [X0] : empty(sK7(X0)),
inference(cnf_transformation,[],[f119]) ).
fof(f188,plain,
! [X0,X1] :
( union_of_subsets(X0,X1) = union(X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(cnf_transformation,[],[f90]) ).
fof(f191,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
fof(f195,plain,
~ empty_carrier(sK10),
inference(cnf_transformation,[],[f126]) ).
fof(f196,plain,
one_sorted_str(sK10),
inference(cnf_transformation,[],[f126]) ).
fof(f197,plain,
element(sK11,powerset(powerset(the_carrier(sK10)))),
inference(cnf_transformation,[],[f126]) ).
fof(f198,plain,
is_a_cover_of_carrier(sK10,sK11),
inference(cnf_transformation,[],[f126]) ).
fof(f199,plain,
empty_set = sK11,
inference(cnf_transformation,[],[f126]) ).
fof(f200,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f201,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f208,plain,
empty(sK11),
inference(definition_unfolding,[],[f168,f199]) ).
fof(f209,plain,
! [X0] :
( sK11 = X0
| ~ empty(X0) ),
inference(definition_unfolding,[],[f200,f199]) ).
fof(f211,plain,
! [X0,X5] :
( in(sK2(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f154]) ).
cnf(c_74,plain,
( ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(cnf_transformation,[],[f152]) ).
cnf(c_79,plain,
( ~ in(X0,union(X1))
| in(sK2(X1,X0),X1) ),
inference(cnf_transformation,[],[f211]) ).
cnf(c_82,plain,
( ~ element(X0,powerset(powerset(the_carrier(X1))))
| ~ is_a_cover_of_carrier(X1,X0)
| ~ one_sorted_str(X1)
| union_of_subsets(the_carrier(X1),X0) = cast_as_carrier_subset(X1) ),
inference(cnf_transformation,[],[f159]) ).
cnf(c_86,plain,
element(sK4(X0),X0),
inference(cnf_transformation,[],[f164]) ).
cnf(c_87,plain,
( ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f165]) ).
cnf(c_95,negated_conjecture,
empty(sK11),
inference(cnf_transformation,[],[f208]) ).
cnf(c_104,plain,
empty(sK7(X0)),
inference(cnf_transformation,[],[f183]) ).
cnf(c_105,plain,
element(sK7(X0),powerset(X0)),
inference(cnf_transformation,[],[f182]) ).
cnf(c_110,plain,
( ~ element(X0,powerset(powerset(X1)))
| union_of_subsets(X1,X0) = union(X0) ),
inference(cnf_transformation,[],[f188]) ).
cnf(c_113,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f191]) ).
cnf(c_117,negated_conjecture,
is_a_cover_of_carrier(sK10,sK11),
inference(cnf_transformation,[],[f198]) ).
cnf(c_118,negated_conjecture,
element(sK11,powerset(powerset(the_carrier(sK10)))),
inference(cnf_transformation,[],[f197]) ).
cnf(c_119,negated_conjecture,
one_sorted_str(sK10),
inference(cnf_transformation,[],[f196]) ).
cnf(c_120,negated_conjecture,
~ empty_carrier(sK10),
inference(cnf_transformation,[],[f195]) ).
cnf(c_121,negated_conjecture,
( ~ empty(X0)
| X0 = sK11 ),
inference(cnf_transformation,[],[f209]) ).
cnf(c_122,plain,
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f201]) ).
cnf(c_756,plain,
( X0 != sK11
| X1 != sK10
| ~ element(X0,powerset(powerset(the_carrier(X1))))
| ~ one_sorted_str(X1)
| union_of_subsets(the_carrier(X1),X0) = cast_as_carrier_subset(X1) ),
inference(resolution_lifted,[status(thm)],[c_82,c_117]) ).
cnf(c_757,plain,
( ~ element(sK11,powerset(powerset(the_carrier(sK10))))
| ~ one_sorted_str(sK10)
| union_of_subsets(the_carrier(sK10),sK11) = cast_as_carrier_subset(sK10) ),
inference(unflattening,[status(thm)],[c_756]) ).
cnf(c_758,plain,
union_of_subsets(the_carrier(sK10),sK11) = cast_as_carrier_subset(sK10),
inference(global_subsumption_just,[status(thm)],[c_757,c_119,c_118,c_757]) ).
cnf(c_813,plain,
( X0 != sK10
| ~ empty(the_carrier(X0))
| ~ one_sorted_str(X0) ),
inference(resolution_lifted,[status(thm)],[c_87,c_120]) ).
cnf(c_814,plain,
( ~ empty(the_carrier(sK10))
| ~ one_sorted_str(sK10) ),
inference(unflattening,[status(thm)],[c_813]) ).
cnf(c_815,plain,
~ empty(the_carrier(sK10)),
inference(global_subsumption_just,[status(thm)],[c_814,c_119,c_814]) ).
cnf(c_853,plain,
( X0 != sK10
| cast_as_carrier_subset(X0) = the_carrier(X0) ),
inference(resolution_lifted,[status(thm)],[c_74,c_119]) ).
cnf(c_854,plain,
cast_as_carrier_subset(sK10) = the_carrier(sK10),
inference(unflattening,[status(thm)],[c_853]) ).
cnf(c_1023,plain,
union_of_subsets(the_carrier(sK10),sK11) = the_carrier(sK10),
inference(light_normalisation,[status(thm)],[c_758,c_854]) ).
cnf(c_1709,plain,
sK7(X0) = sK11,
inference(superposition,[status(thm)],[c_104,c_121]) ).
cnf(c_1712,plain,
element(sK11,powerset(X0)),
inference(light_normalisation,[status(thm)],[c_105,c_1709]) ).
cnf(c_1747,plain,
( in(sK4(X0),X0)
| empty(X0) ),
inference(superposition,[status(thm)],[c_86,c_113]) ).
cnf(c_1768,plain,
( ~ in(X0,union(X1))
| ~ empty(X1) ),
inference(superposition,[status(thm)],[c_79,c_122]) ).
cnf(c_1842,plain,
( ~ empty(X0)
| empty(union(X0)) ),
inference(superposition,[status(thm)],[c_1747,c_1768]) ).
cnf(c_1854,plain,
( ~ empty(X0)
| union(X0) = sK11 ),
inference(superposition,[status(thm)],[c_1842,c_121]) ).
cnf(c_1984,plain,
union(sK11) = sK11,
inference(superposition,[status(thm)],[c_95,c_1854]) ).
cnf(c_2061,plain,
union_of_subsets(X0,sK11) = union(sK11),
inference(superposition,[status(thm)],[c_1712,c_110]) ).
cnf(c_2062,plain,
union_of_subsets(X0,sK11) = sK11,
inference(light_normalisation,[status(thm)],[c_2061,c_1984]) ).
cnf(c_2066,plain,
the_carrier(sK10) = sK11,
inference(demodulation,[status(thm)],[c_1023,c_2062]) ).
cnf(c_2075,plain,
~ empty(sK11),
inference(demodulation,[status(thm)],[c_815,c_2066]) ).
cnf(c_2076,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2075,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU325+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Aug 23 16:18:50 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.41/1.20 % SZS status Started for theBenchmark.p
% 3.41/1.20 % SZS status Theorem for theBenchmark.p
% 3.41/1.20
% 3.41/1.20 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.41/1.20
% 3.41/1.20 ------ iProver source info
% 3.41/1.20
% 3.41/1.20 git: date: 2023-05-31 18:12:56 +0000
% 3.41/1.20 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.41/1.20 git: non_committed_changes: false
% 3.41/1.20 git: last_make_outside_of_git: false
% 3.41/1.20
% 3.41/1.20 ------ Parsing...
% 3.41/1.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.41/1.20
% 3.41/1.20 ------ Preprocessing... sup_sim: 0 sf_s rm: 40 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 8 sf_s rm: 9 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e
% 3.41/1.20
% 3.41/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.41/1.20
% 3.41/1.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.41/1.20 ------ Proving...
% 3.41/1.20 ------ Problem Properties
% 3.41/1.20
% 3.41/1.20
% 3.41/1.20 clauses 36
% 3.41/1.20 conjectures 3
% 3.41/1.20 EPR 8
% 3.41/1.20 Horn 32
% 3.41/1.20 unary 18
% 3.41/1.20 binary 10
% 3.41/1.20 lits 63
% 3.41/1.20 lits eq 10
% 3.41/1.20 fd_pure 0
% 3.41/1.20 fd_pseudo 0
% 3.41/1.20 fd_cond 1
% 3.41/1.20 fd_pseudo_cond 4
% 3.41/1.20 AC symbols 0
% 3.41/1.20
% 3.41/1.20 ------ Schedule dynamic 5 is on
% 3.41/1.20
% 3.41/1.20 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.41/1.20
% 3.41/1.20
% 3.41/1.20 ------
% 3.41/1.20 Current options:
% 3.41/1.20 ------
% 3.41/1.20
% 3.41/1.20
% 3.41/1.20
% 3.41/1.20
% 3.41/1.20 ------ Proving...
% 3.41/1.20
% 3.41/1.20
% 3.41/1.20 % SZS status Theorem for theBenchmark.p
% 3.41/1.20
% 3.41/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.41/1.20
% 3.41/1.20
%------------------------------------------------------------------------------