TSTP Solution File: SEU251+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU251+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:12 EDT 2023
% Result : Theorem 32.41s 5.24s
% Output : CNFRefutation 32.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 10 unt; 0 def)
% Number of atoms : 268 ( 69 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 339 ( 141 ~; 137 |; 44 &)
% ( 8 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 157 ( 2 sgn; 110 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1,X2] :
( fiber(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(ordered_pair(X3,X1),X0)
& X1 != X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_wellord1) ).
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(f8,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f15,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(f30,axiom,
! [X0,X1,X2] :
( relation(X2)
=> ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f32,conjecture,
! [X0,X1,X2] :
( relation(X2)
=> subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_wellord1) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2] :
( relation(X2)
=> subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1)) ),
inference(negated_conjecture,[],[f32]) ).
fof(f50,plain,
! [X0] :
( ! [X1,X2] :
( fiber(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(ordered_pair(X3,X1),X0)
& X1 != X3 ) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f53,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( in(X0,relation_restriction(X2,X1))
<=> ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) ) )
| ~ relation(X2) ),
inference(ennf_transformation,[],[f30]) ).
fof(f56,plain,
? [X0,X1,X2] :
( ~ subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1))
& relation(X2) ),
inference(ennf_transformation,[],[f33]) ).
fof(f65,plain,
! [X0] :
( ! [X1,X2] :
( ( fiber(X0,X1) = X2
| ? [X3] :
( ( ~ in(ordered_pair(X3,X1),X0)
| X1 = X3
| ~ in(X3,X2) )
& ( ( in(ordered_pair(X3,X1),X0)
& X1 != X3 )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(ordered_pair(X3,X1),X0)
| X1 = X3 )
& ( ( in(ordered_pair(X3,X1),X0)
& X1 != X3 )
| ~ in(X3,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f50]) ).
fof(f66,plain,
! [X0] :
( ! [X1,X2] :
( ( fiber(X0,X1) = X2
| ? [X3] :
( ( ~ in(ordered_pair(X3,X1),X0)
| X1 = X3
| ~ in(X3,X2) )
& ( ( in(ordered_pair(X3,X1),X0)
& X1 != X3 )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(ordered_pair(X3,X1),X0)
| X1 = X3 )
& ( ( in(ordered_pair(X3,X1),X0)
& X1 != X3 )
| ~ in(X3,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(flattening,[],[f65]) ).
fof(f67,plain,
! [X0] :
( ! [X1,X2] :
( ( fiber(X0,X1) = X2
| ? [X3] :
( ( ~ in(ordered_pair(X3,X1),X0)
| X1 = X3
| ~ in(X3,X2) )
& ( ( in(ordered_pair(X3,X1),X0)
& X1 != X3 )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(ordered_pair(X4,X1),X0)
| X1 = X4 )
& ( ( in(ordered_pair(X4,X1),X0)
& X1 != X4 )
| ~ in(X4,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(rectify,[],[f66]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(ordered_pair(X3,X1),X0)
| X1 = X3
| ~ in(X3,X2) )
& ( ( in(ordered_pair(X3,X1),X0)
& X1 != X3 )
| in(X3,X2) ) )
=> ( ( ~ in(ordered_pair(sK0(X0,X1,X2),X1),X0)
| sK0(X0,X1,X2) = X1
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(ordered_pair(sK0(X0,X1,X2),X1),X0)
& sK0(X0,X1,X2) != X1 )
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0] :
( ! [X1,X2] :
( ( fiber(X0,X1) = X2
| ( ( ~ in(ordered_pair(sK0(X0,X1,X2),X1),X0)
| sK0(X0,X1,X2) = X1
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(ordered_pair(sK0(X0,X1,X2),X1),X0)
& sK0(X0,X1,X2) != X1 )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(ordered_pair(X4,X1),X0)
| X1 = X4 )
& ( ( in(ordered_pair(X4,X1),X0)
& X1 != X4 )
| ~ in(X4,X2) ) )
| fiber(X0,X1) != X2 ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f67,f68]) ).
fof(f70,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,[],[f51]) ).
fof(f71,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,[],[f70]) ).
fof(f72,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK1(X0,X1),X1)
& in(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f71,f72]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2) )
& ( ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(nnf_transformation,[],[f54]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ( ( in(X0,relation_restriction(X2,X1))
| ~ in(X0,cartesian_product2(X1,X1))
| ~ in(X0,X2) )
& ( ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) )
| ~ in(X0,relation_restriction(X2,X1)) ) )
| ~ relation(X2) ),
inference(flattening,[],[f86]) ).
fof(f88,plain,
( ? [X0,X1,X2] :
( ~ subset(fiber(relation_restriction(X2,X0),X1),fiber(X2,X1))
& relation(X2) )
=> ( ~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
& relation(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
( ~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
& relation(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f56,f88]) ).
fof(f97,plain,
! [X2,X0,X1,X4] :
( X1 != X4
| ~ in(X4,X2)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f98,plain,
! [X2,X0,X1,X4] :
( in(ordered_pair(X4,X1),X0)
| ~ in(X4,X2)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f99,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(ordered_pair(X4,X1),X0)
| X1 = X4
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f104,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f73]) ).
fof(f105,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f106,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f108,plain,
! [X0,X1] :
( relation(relation_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f123,plain,
! [X2,X0,X1] :
( in(X0,X2)
| ~ in(X0,relation_restriction(X2,X1))
| ~ relation(X2) ),
inference(cnf_transformation,[],[f87]) ).
fof(f127,plain,
relation(sK10),
inference(cnf_transformation,[],[f89]) ).
fof(f128,plain,
~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),
inference(cnf_transformation,[],[f89]) ).
fof(f140,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| X1 = X4
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(definition_unfolding,[],[f99,f106]) ).
fof(f141,plain,
! [X2,X0,X1,X4] :
( in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| ~ in(X4,X2)
| fiber(X0,X1) != X2
| ~ relation(X0) ),
inference(definition_unfolding,[],[f98,f106]) ).
fof(f143,plain,
! [X0,X1,X4] :
( in(X4,fiber(X0,X1))
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| X1 = X4
| ~ relation(X0) ),
inference(equality_resolution,[],[f140]) ).
fof(f144,plain,
! [X0,X1,X4] :
( in(unordered_pair(unordered_pair(X4,X1),singleton(X4)),X0)
| ~ in(X4,fiber(X0,X1))
| ~ relation(X0) ),
inference(equality_resolution,[],[f141]) ).
fof(f145,plain,
! [X2,X0,X4] :
( ~ in(X4,X2)
| fiber(X0,X4) != X2
| ~ relation(X0) ),
inference(equality_resolution,[],[f97]) ).
fof(f146,plain,
! [X0,X4] :
( ~ in(X4,fiber(X0,X4))
| ~ relation(X0) ),
inference(equality_resolution,[],[f145]) ).
cnf(c_56,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| ~ relation(X2)
| X0 = X1
| in(X0,fiber(X2,X1)) ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_57,plain,
( ~ in(X0,fiber(X1,X2))
| ~ relation(X1)
| in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),X1) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_58,plain,
( ~ in(X0,fiber(X1,X0))
| ~ relation(X1) ),
inference(cnf_transformation,[],[f146]) ).
cnf(c_59,plain,
( ~ in(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_60,plain,
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_63,plain,
( ~ relation(X0)
| relation(relation_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f108]) ).
cnf(c_80,plain,
( ~ in(X0,relation_restriction(X1,X2))
| ~ relation(X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
cnf(c_82,negated_conjecture,
~ subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),
inference(cnf_transformation,[],[f128]) ).
cnf(c_83,negated_conjecture,
relation(sK10),
inference(cnf_transformation,[],[f127]) ).
cnf(c_290,plain,
X0 = X0,
theory(equality) ).
cnf(c_292,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_293,plain,
( X0 != X1
| X2 != X3
| ~ in(X1,X3)
| in(X0,X2) ),
theory(equality) ).
cnf(c_647,plain,
( in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(relation_restriction(sK10,sK8),sK9))
| subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_699,plain,
fiber(relation_restriction(sK10,sK8),sK9) = fiber(relation_restriction(sK10,sK8),sK9),
inference(instantiation,[status(thm)],[c_290]) ).
cnf(c_768,plain,
( ~ in(X0,fiber(relation_restriction(sK10,X1),X2))
| ~ relation(relation_restriction(sK10,X1))
| in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),relation_restriction(sK10,X1)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_1138,plain,
sK9 = sK9,
inference(instantiation,[status(thm)],[c_290]) ).
cnf(c_1143,plain,
( ~ in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(relation_restriction(sK10,sK8),sK9))
| ~ relation(relation_restriction(sK10,sK8))
| in(unordered_pair(unordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),singleton(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)))),relation_restriction(sK10,sK8)) ),
inference(instantiation,[status(thm)],[c_768]) ).
cnf(c_1556,plain,
( ~ relation(sK10)
| relation(relation_restriction(sK10,sK8)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_1570,plain,
( sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) != X0
| X1 != X0
| X1 = sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
inference(instantiation,[status(thm)],[c_292]) ).
cnf(c_1790,plain,
( ~ in(unordered_pair(unordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),singleton(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)))),relation_restriction(sK10,sK8))
| ~ relation(sK10)
| in(unordered_pair(unordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),singleton(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)))),sK10) ),
inference(instantiation,[status(thm)],[c_80]) ).
cnf(c_2795,plain,
( ~ in(unordered_pair(unordered_pair(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),sK9),singleton(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)))),sK10)
| ~ relation(sK10)
| sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) = sK9
| in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(sK10,sK9)) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_5585,plain,
( sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) != X0
| sK9 != X0
| sK9 = sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
inference(instantiation,[status(thm)],[c_1570]) ).
cnf(c_8660,plain,
( sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) != sK9
| sK9 != sK9
| sK9 = sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
inference(instantiation,[status(thm)],[c_5585]) ).
cnf(c_20974,plain,
( ~ in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(sK10,sK9))
| subset(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_21176,plain,
( X0 != sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| X1 != fiber(relation_restriction(sK10,sK8),sK9)
| ~ in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(relation_restriction(sK10,sK8),sK9))
| in(X0,X1) ),
inference(instantiation,[status(thm)],[c_293]) ).
cnf(c_28488,plain,
( fiber(relation_restriction(sK10,sK8),sK9) != fiber(relation_restriction(sK10,sK8),sK9)
| X0 != sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| ~ in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(relation_restriction(sK10,sK8),sK9))
| in(X0,fiber(relation_restriction(sK10,sK8),sK9)) ),
inference(instantiation,[status(thm)],[c_21176]) ).
cnf(c_28816,plain,
( ~ in(sK9,fiber(relation_restriction(sK10,sK8),sK9))
| ~ relation(relation_restriction(sK10,sK8)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_34196,plain,
( fiber(relation_restriction(sK10,sK8),sK9) != fiber(relation_restriction(sK10,sK8),sK9)
| sK9 != sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9))
| ~ in(sK1(fiber(relation_restriction(sK10,sK8),sK9),fiber(sK10,sK9)),fiber(relation_restriction(sK10,sK8),sK9))
| in(sK9,fiber(relation_restriction(sK10,sK8),sK9)) ),
inference(instantiation,[status(thm)],[c_28488]) ).
cnf(c_34197,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_34196,c_28816,c_20974,c_8660,c_2795,c_1790,c_1556,c_1143,c_1138,c_699,c_647,c_82,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU251+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n010.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 : Wed Aug 23 20:40:51 EDT 2023
% 0.13/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
% 32.41/5.24 % SZS status Started for theBenchmark.p
% 32.41/5.24 % SZS status Theorem for theBenchmark.p
% 32.41/5.24
% 32.41/5.24 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 32.41/5.24
% 32.41/5.24 ------ iProver source info
% 32.41/5.24
% 32.41/5.24 git: date: 2023-05-31 18:12:56 +0000
% 32.41/5.24 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 32.41/5.24 git: non_committed_changes: false
% 32.41/5.24 git: last_make_outside_of_git: false
% 32.41/5.24
% 32.41/5.24 ------ Parsing...
% 32.41/5.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 32.41/5.24
% 32.41/5.24 ------ Preprocessing...
% 32.41/5.24
% 32.41/5.24 ------ Preprocessing...
% 32.41/5.24
% 32.41/5.24 ------ Preprocessing...
% 32.41/5.24 ------ Proving...
% 32.41/5.24 ------ Problem Properties
% 32.41/5.24
% 32.41/5.24
% 32.41/5.24 clauses 44
% 32.41/5.24 conjectures 2
% 32.41/5.24 EPR 20
% 32.41/5.24 Horn 38
% 32.41/5.24 unary 19
% 32.41/5.24 binary 12
% 32.41/5.24 lits 88
% 32.41/5.24 lits eq 13
% 32.41/5.24 fd_pure 0
% 32.41/5.24 fd_pseudo 0
% 32.41/5.24 fd_cond 1
% 32.41/5.24 fd_pseudo_cond 4
% 32.41/5.24 AC symbols 0
% 32.41/5.24
% 32.41/5.24 ------ Input Options Time Limit: Unbounded
% 32.41/5.24
% 32.41/5.24
% 32.41/5.24 ------
% 32.41/5.24 Current options:
% 32.41/5.24 ------
% 32.41/5.24
% 32.41/5.24
% 32.41/5.24
% 32.41/5.24
% 32.41/5.24 ------ Proving...
% 32.41/5.24
% 32.41/5.24
% 32.41/5.24 % SZS status Theorem for theBenchmark.p
% 32.41/5.24
% 32.41/5.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 32.41/5.24
% 32.41/5.24
%------------------------------------------------------------------------------