TSTP Solution File: SEU224+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU224+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:04:54 EDT 2023
% Result : Theorem 2.95s 1.14s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 10 unt; 0 def)
% Number of atoms : 314 ( 54 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 399 ( 151 ~; 151 |; 78 &)
% ( 7 <=>; 10 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 147 ( 5 sgn; 99 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f11,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f18,axiom,
! [X0,X1] :
( ( function(X0)
& relation(X0) )
=> ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(f23,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l82_funct_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<=> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f36,axiom,
! [X0,X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(f48,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f53,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f54,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f53]) ).
fof(f58,plain,
? [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<~> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) )
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f59,plain,
? [X0,X1,X2] :
( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
<~> ( in(X1,X0)
& in(X1,relation_dom(X2)) ) )
& function(X2)
& relation(X2) ),
inference(flattening,[],[f58]) ).
fof(f63,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f64,plain,
! [X0,X1] :
( ! [X2] :
( ( relation_dom_restriction(X2,X0) = X1
<=> ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f63]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK0(X0,X1,X2),X1)
| ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(sK0(X0,X1,X2),X1)
& in(sK0(X0,X1,X2),X0) )
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK0(X0,X1,X2),X1)
| ~ in(sK0(X0,X1,X2),X0)
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( in(sK0(X0,X1,X2),X1)
& in(sK0(X0,X1,X2),X0) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f70,f71]) ).
fof(f75,plain,
? [X0,X1,X2] :
( ( ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| in(X1,relation_dom(relation_dom_restriction(X2,X0))) )
& function(X2)
& relation(X2) ),
inference(nnf_transformation,[],[f59]) ).
fof(f76,plain,
? [X0,X1,X2] :
( ( ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| in(X1,relation_dom(relation_dom_restriction(X2,X0))) )
& function(X2)
& relation(X2) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
( ? [X0,X1,X2] :
( ( ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| in(X1,relation_dom(relation_dom_restriction(X2,X0))) )
& function(X2)
& relation(X2) )
=> ( ( ~ in(sK3,sK2)
| ~ in(sK3,relation_dom(sK4))
| ~ in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) )
& ( ( in(sK3,sK2)
& in(sK3,relation_dom(sK4)) )
| in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) )
& function(sK4)
& relation(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f78,plain,
( ( ~ in(sK3,sK2)
| ~ in(sK3,relation_dom(sK4))
| ~ in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) )
& ( ( in(sK3,sK2)
& in(sK3,relation_dom(sK4)) )
| in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) )
& function(sK4)
& relation(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f76,f77]) ).
fof(f95,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(nnf_transformation,[],[f64]) ).
fof(f96,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X3] :
( apply(X1,X3) = apply(X2,X3)
| ~ in(X3,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(flattening,[],[f95]) ).
fof(f97,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(rectify,[],[f96]) ).
fof(f98,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK13(X1,X2)) != apply(X2,sK13(X1,X2))
& in(sK13(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK13(X1,X2)) != apply(X2,sK13(X1,X2))
& in(sK13(X1,X2),relation_dom(X1)) )
| relation_dom(X1) != set_intersection2(relation_dom(X2),X0) )
& ( ( ! [X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1)) )
& relation_dom(X1) = set_intersection2(relation_dom(X2),X0) )
| relation_dom_restriction(X2,X0) != X1 ) )
| ~ function(X2)
| ~ relation(X2) )
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f97,f98]) ).
fof(f106,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f107,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f108,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f112,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f122,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f129,plain,
relation(sK4),
inference(cnf_transformation,[],[f78]) ).
fof(f130,plain,
function(sK4),
inference(cnf_transformation,[],[f78]) ).
fof(f131,plain,
( in(sK3,relation_dom(sK4))
| in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) ),
inference(cnf_transformation,[],[f78]) ).
fof(f132,plain,
( in(sK3,sK2)
| in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) ),
inference(cnf_transformation,[],[f78]) ).
fof(f133,plain,
( ~ in(sK3,sK2)
| ~ in(sK3,relation_dom(sK4))
| ~ in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))) ),
inference(cnf_transformation,[],[f78]) ).
fof(f152,plain,
! [X2,X0,X1] :
( relation_dom(X1) = set_intersection2(relation_dom(X2),X0)
| relation_dom_restriction(X2,X0) != X1
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f159,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f108]) ).
fof(f160,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f107]) ).
fof(f161,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f106]) ).
fof(f163,plain,
! [X2,X0] :
( relation_dom(relation_dom_restriction(X2,X0)) = set_intersection2(relation_dom(X2),X0)
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f152]) ).
cnf(c_56,plain,
( ~ in(X0,X1)
| ~ in(X0,X2)
| in(X0,set_intersection2(X2,X1)) ),
inference(cnf_transformation,[],[f159]) ).
cnf(c_57,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f160]) ).
cnf(c_58,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f161]) ).
cnf(c_59,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_68,plain,
( ~ function(X0)
| ~ relation(X0)
| function(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f122]) ).
cnf(c_76,negated_conjecture,
( ~ in(sK3,relation_dom(relation_dom_restriction(sK4,sK2)))
| ~ in(sK3,relation_dom(sK4))
| ~ in(sK3,sK2) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_77,negated_conjecture,
( in(sK3,relation_dom(relation_dom_restriction(sK4,sK2)))
| in(sK3,sK2) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_78,negated_conjecture,
( in(sK3,relation_dom(relation_dom_restriction(sK4,sK2)))
| in(sK3,relation_dom(sK4)) ),
inference(cnf_transformation,[],[f131]) ).
cnf(c_79,negated_conjecture,
function(sK4),
inference(cnf_transformation,[],[f130]) ).
cnf(c_80,negated_conjecture,
relation(sK4),
inference(cnf_transformation,[],[f129]) ).
cnf(c_102,plain,
( ~ function(relation_dom_restriction(X0,X1))
| ~ relation(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0)
| set_intersection2(relation_dom(X0),X1) = relation_dom(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f163]) ).
cnf(c_130,plain,
( ~ function(X0)
| ~ relation(X0)
| set_intersection2(relation_dom(X0),X1) = relation_dom(relation_dom_restriction(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_102,c_59,c_68,c_102]) ).
cnf(c_1672,plain,
( ~ relation(sK4)
| set_intersection2(relation_dom(sK4),X0) = relation_dom(relation_dom_restriction(sK4,X0)) ),
inference(superposition,[status(thm)],[c_79,c_130]) ).
cnf(c_1681,plain,
set_intersection2(relation_dom(sK4),X0) = relation_dom(relation_dom_restriction(sK4,X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_1672,c_80]) ).
cnf(c_1840,plain,
( ~ in(X0,relation_dom(sK4))
| ~ in(X0,X1)
| in(X0,relation_dom(relation_dom_restriction(sK4,X1))) ),
inference(superposition,[status(thm)],[c_1681,c_56]) ).
cnf(c_1841,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(sK4,X1)))
| in(X0,relation_dom(sK4)) ),
inference(superposition,[status(thm)],[c_1681,c_58]) ).
cnf(c_1842,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(sK4,X1)))
| in(X0,X1) ),
inference(superposition,[status(thm)],[c_1681,c_57]) ).
cnf(c_1904,plain,
in(sK3,sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_77,c_1842]) ).
cnf(c_1905,plain,
( ~ in(sK3,relation_dom(relation_dom_restriction(sK4,sK2)))
| ~ in(sK3,relation_dom(sK4)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_76,c_1842]) ).
cnf(c_2322,plain,
( ~ in(sK3,relation_dom(sK4))
| ~ in(sK3,sK2) ),
inference(superposition,[status(thm)],[c_1840,c_1905]) ).
cnf(c_2326,plain,
~ in(sK3,relation_dom(sK4)),
inference(forward_subsumption_resolution,[status(thm)],[c_2322,c_1904]) ).
cnf(c_2348,plain,
in(sK3,relation_dom(relation_dom_restriction(sK4,sK2))),
inference(backward_subsumption_resolution,[status(thm)],[c_78,c_2326]) ).
cnf(c_2496,plain,
in(sK3,relation_dom(sK4)),
inference(superposition,[status(thm)],[c_2348,c_1841]) ).
cnf(c_2502,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2496,c_2326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU224+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Aug 23 15:20:36 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.95/1.14 % SZS status Started for theBenchmark.p
% 2.95/1.14 % SZS status Theorem for theBenchmark.p
% 2.95/1.14
% 2.95/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.95/1.14
% 2.95/1.14 ------ iProver source info
% 2.95/1.14
% 2.95/1.14 git: date: 2023-05-31 18:12:56 +0000
% 2.95/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.95/1.14 git: non_committed_changes: false
% 2.95/1.14 git: last_make_outside_of_git: false
% 2.95/1.14
% 2.95/1.14 ------ Parsing...
% 2.95/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.95/1.14
% 2.95/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 2.95/1.14
% 2.95/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.95/1.14
% 2.95/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.95/1.14 ------ Proving...
% 2.95/1.14 ------ Problem Properties
% 2.95/1.14
% 2.95/1.14
% 2.95/1.14 clauses 47
% 2.95/1.14 conjectures 5
% 2.95/1.14 EPR 24
% 2.95/1.14 Horn 41
% 2.95/1.14 unary 21
% 2.95/1.14 binary 13
% 2.95/1.14 lits 96
% 2.95/1.14 lits eq 15
% 2.95/1.14 fd_pure 0
% 2.95/1.14 fd_pseudo 0
% 2.95/1.14 fd_cond 1
% 2.95/1.14 fd_pseudo_cond 6
% 2.95/1.14 AC symbols 0
% 2.95/1.14
% 2.95/1.14 ------ Schedule dynamic 5 is on
% 2.95/1.14
% 2.95/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.95/1.14
% 2.95/1.14
% 2.95/1.14 ------
% 2.95/1.14 Current options:
% 2.95/1.14 ------
% 2.95/1.14
% 2.95/1.14
% 2.95/1.14
% 2.95/1.14
% 2.95/1.14 ------ Proving...
% 2.95/1.14
% 2.95/1.14
% 2.95/1.14 % SZS status Theorem for theBenchmark.p
% 2.95/1.14
% 2.95/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.95/1.14
% 2.95/1.14
%------------------------------------------------------------------------------