TSTP Solution File: SEU212+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU212+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:44 EDT 2023
% Result : Theorem 2.80s 1.15s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 69 ( 13 unt; 0 def)
% Number of atoms : 277 ( 66 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 336 ( 128 ~; 136 |; 48 &)
% ( 12 <=>; 10 =>; 0 <=; 2 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 145 ( 4 sgn; 80 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f5,axiom,
! [X0] :
( ( function(X0)
& relation(X0) )
=> ! [X1,X2] :
( ( ~ in(X1,relation_dom(X0))
=> ( apply(X0,X1) = X2
<=> empty_set = X2 ) )
& ( in(X1,relation_dom(X0))
=> ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( relation_dom(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f35,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_funct_1) ).
fof(f36,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(ordered_pair(X0,X1),X2)
<=> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) ) ),
inference(negated_conjecture,[],[f35]) ).
fof(f42,plain,
! [X0] :
( ! [X1,X2] :
( ( ( apply(X0,X1) = X2
<=> empty_set = X2 )
| in(X1,relation_dom(X0)) )
& ( ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f43,plain,
! [X0] :
( ! [X1,X2] :
( ( ( apply(X0,X1) = X2
<=> empty_set = X2 )
| in(X1,relation_dom(X0)) )
& ( ( apply(X0,X1) = X2
<=> in(ordered_pair(X1,X2),X0) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f42]) ).
fof(f44,plain,
! [X0] :
( ! [X1] :
( relation_dom(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] : in(ordered_pair(X2,X3),X0) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f54,plain,
? [X0,X1,X2] :
( ( in(ordered_pair(X0,X1),X2)
<~> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) )
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f36]) ).
fof(f55,plain,
? [X0,X1,X2] :
( ( in(ordered_pair(X0,X1),X2)
<~> ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) ) )
& function(X2)
& relation(X2) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0] :
( ! [X1,X2] :
( ( ( ( apply(X0,X1) = X2
| empty_set != X2 )
& ( empty_set = X2
| apply(X0,X1) != X2 ) )
| in(X1,relation_dom(X0)) )
& ( ( ( apply(X0,X1) = X2
| ~ in(ordered_pair(X1,X2),X0) )
& ( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2 ) )
| ~ in(X1,relation_dom(X0)) ) )
| ~ function(X0)
| ~ relation(X0) ),
inference(nnf_transformation,[],[f43]) ).
fof(f57,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] : ~ in(ordered_pair(X2,X3),X0) )
& ( ? [X3] : in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f44]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( ? [X7] : in(ordered_pair(X5,X7),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] : ~ in(ordered_pair(X2,X3),X0)
| ~ in(X2,X1) )
& ( ? [X4] : in(ordered_pair(X2,X4),X0)
| in(X2,X1) ) )
=> ( ( ! [X3] : ~ in(ordered_pair(sK0(X0,X1),X3),X0)
| ~ in(sK0(X0,X1),X1) )
& ( ? [X4] : in(ordered_pair(sK0(X0,X1),X4),X0)
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X4] : in(ordered_pair(sK0(X0,X1),X4),X0)
=> in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
! [X0,X5] :
( ? [X7] : in(ordered_pair(X5,X7),X0)
=> in(ordered_pair(X5,sK2(X0,X5)),X0) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( relation_dom(X0) = X1
| ( ( ! [X3] : ~ in(ordered_pair(sK0(X0,X1),X3),X0)
| ~ in(sK0(X0,X1),X1) )
& ( in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] : ~ in(ordered_pair(X5,X6),X0) )
& ( in(ordered_pair(X5,sK2(X0,X5)),X0)
| ~ in(X5,X1) ) )
| relation_dom(X0) != X1 ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f58,f61,f60,f59]) ).
fof(f77,plain,
? [X0,X1,X2] :
( ( apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) )
| in(ordered_pair(X0,X1),X2) )
& function(X2)
& relation(X2) ),
inference(nnf_transformation,[],[f55]) ).
fof(f78,plain,
? [X0,X1,X2] :
( ( apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) )
| in(ordered_pair(X0,X1),X2) )
& function(X2)
& relation(X2) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
( ? [X0,X1,X2] :
( ( apply(X2,X0) != X1
| ~ in(X0,relation_dom(X2))
| ~ in(ordered_pair(X0,X1),X2) )
& ( ( apply(X2,X0) = X1
& in(X0,relation_dom(X2)) )
| in(ordered_pair(X0,X1),X2) )
& function(X2)
& relation(X2) )
=> ( ( sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12))
| ~ in(ordered_pair(sK10,sK11),sK12) )
& ( ( sK11 = apply(sK12,sK10)
& in(sK10,relation_dom(sK12)) )
| in(ordered_pair(sK10,sK11),sK12) )
& function(sK12)
& relation(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f80,plain,
( ( sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12))
| ~ in(ordered_pair(sK10,sK11),sK12) )
& ( ( sK11 = apply(sK12,sK10)
& in(sK10,relation_dom(sK12)) )
| in(ordered_pair(sK10,sK11),sK12) )
& function(sK12)
& relation(sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f78,f79]) ).
fof(f84,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f85,plain,
! [X2,X0,X1] :
( in(ordered_pair(X1,X2),X0)
| apply(X0,X1) != X2
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f86,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| ~ in(ordered_pair(X1,X2),X0)
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f90,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(ordered_pair(X5,X6),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f93,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f120,plain,
relation(sK12),
inference(cnf_transformation,[],[f80]) ).
fof(f121,plain,
function(sK12),
inference(cnf_transformation,[],[f80]) ).
fof(f122,plain,
( in(sK10,relation_dom(sK12))
| in(ordered_pair(sK10,sK11),sK12) ),
inference(cnf_transformation,[],[f80]) ).
fof(f123,plain,
( sK11 = apply(sK12,sK10)
| in(ordered_pair(sK10,sK11),sK12) ),
inference(cnf_transformation,[],[f80]) ).
fof(f124,plain,
( sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12))
| ~ in(ordered_pair(sK10,sK11),sK12) ),
inference(cnf_transformation,[],[f80]) ).
fof(f125,plain,
! [X2,X0,X1] :
( apply(X0,X1) = X2
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f86,f93]) ).
fof(f126,plain,
! [X2,X0,X1] :
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X0)
| apply(X0,X1) != X2
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f85,f93]) ).
fof(f129,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| relation_dom(X0) != X1
| ~ relation(X0) ),
inference(definition_unfolding,[],[f90,f93]) ).
fof(f132,plain,
( sK11 != apply(sK12,sK10)
| ~ in(sK10,relation_dom(sK12))
| ~ in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(definition_unfolding,[],[f124,f93]) ).
fof(f133,plain,
( sK11 = apply(sK12,sK10)
| in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(definition_unfolding,[],[f123,f93]) ).
fof(f134,plain,
( in(sK10,relation_dom(sK12))
| in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(definition_unfolding,[],[f122,f93]) ).
fof(f137,plain,
! [X0,X1] :
( in(unordered_pair(unordered_pair(X1,apply(X0,X1)),singleton(X1)),X0)
| ~ in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f126]) ).
fof(f138,plain,
! [X0,X6,X5] :
( in(X5,relation_dom(X0))
| ~ in(unordered_pair(unordered_pair(X5,X6),singleton(X5)),X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f129]) ).
cnf(c_52,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f84]) ).
cnf(c_55,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| ~ in(X0,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| apply(X2,X0) = X1 ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_56,plain,
( ~ in(X0,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| in(unordered_pair(unordered_pair(X0,apply(X1,X0)),singleton(X0)),X1) ),
inference(cnf_transformation,[],[f137]) ).
cnf(c_59,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| ~ relation(X2)
| in(X0,relation_dom(X2)) ),
inference(cnf_transformation,[],[f138]) ).
cnf(c_87,negated_conjecture,
( apply(sK12,sK10) != sK11
| ~ in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| ~ in(sK10,relation_dom(sK12)) ),
inference(cnf_transformation,[],[f132]) ).
cnf(c_88,negated_conjecture,
( apply(sK12,sK10) = sK11
| in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12) ),
inference(cnf_transformation,[],[f133]) ).
cnf(c_89,negated_conjecture,
( in(unordered_pair(unordered_pair(sK10,sK11),singleton(sK10)),sK12)
| in(sK10,relation_dom(sK12)) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_90,negated_conjecture,
function(sK12),
inference(cnf_transformation,[],[f121]) ).
cnf(c_91,negated_conjecture,
relation(sK12),
inference(cnf_transformation,[],[f120]) ).
cnf(c_115,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),X2)
| ~ function(X2)
| ~ relation(X2)
| apply(X2,X0) = X1 ),
inference(global_subsumption_just,[status(thm)],[c_55,c_59,c_55]) ).
cnf(c_316,plain,
( in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| in(sK10,relation_dom(sK12)) ),
inference(demodulation,[status(thm)],[c_89,c_52]) ).
cnf(c_321,plain,
( apply(sK12,sK10) = sK11
| in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12) ),
inference(demodulation,[status(thm)],[c_88,c_52]) ).
cnf(c_326,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
| ~ relation(X2)
| in(X0,relation_dom(X2)) ),
inference(demodulation,[status(thm)],[c_59,c_52]) ).
cnf(c_348,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),X2)
| ~ function(X2)
| ~ relation(X2)
| apply(X2,X0) = X1 ),
inference(demodulation,[status(thm)],[c_115,c_52]) ).
cnf(c_357,plain,
( apply(sK12,sK10) != sK11
| ~ in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12)
| ~ in(sK10,relation_dom(sK12)) ),
inference(demodulation,[status(thm)],[c_87,c_52]) ).
cnf(c_364,plain,
( ~ in(X0,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| in(unordered_pair(singleton(X0),unordered_pair(X0,apply(X1,X0))),X1) ),
inference(demodulation,[status(thm)],[c_56,c_52]) ).
cnf(c_466,plain,
( X0 != sK12
| ~ in(X1,relation_dom(X0))
| ~ relation(X0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X0,X1))),X0) ),
inference(resolution_lifted,[status(thm)],[c_364,c_90]) ).
cnf(c_467,plain,
( ~ in(X0,relation_dom(sK12))
| ~ relation(sK12)
| in(unordered_pair(singleton(X0),unordered_pair(X0,apply(sK12,X0))),sK12) ),
inference(unflattening,[status(thm)],[c_466]) ).
cnf(c_469,plain,
( ~ in(X0,relation_dom(sK12))
| in(unordered_pair(singleton(X0),unordered_pair(X0,apply(sK12,X0))),sK12) ),
inference(global_subsumption_just,[status(thm)],[c_467,c_91,c_467]) ).
cnf(c_517,plain,
( X0 != sK12
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X0)
| ~ relation(X0)
| apply(X0,X1) = X2 ),
inference(resolution_lifted,[status(thm)],[c_348,c_90]) ).
cnf(c_518,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12)
| ~ relation(sK12)
| apply(sK12,X0) = X1 ),
inference(unflattening,[status(thm)],[c_517]) ).
cnf(c_520,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12)
| apply(sK12,X0) = X1 ),
inference(global_subsumption_just,[status(thm)],[c_518,c_91,c_518]) ).
cnf(c_544,plain,
apply(sK12,sK10) = sK11,
inference(backward_subsumption_resolution,[status(thm)],[c_321,c_520]) ).
cnf(c_888,plain,
( X0 != sK12
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X0)
| in(X1,relation_dom(X0)) ),
inference(resolution_lifted,[status(thm)],[c_326,c_91]) ).
cnf(c_889,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK12)
| in(X0,relation_dom(sK12)) ),
inference(unflattening,[status(thm)],[c_888]) ).
cnf(c_971,plain,
in(sK10,relation_dom(sK12)),
inference(backward_subsumption_resolution,[status(thm)],[c_316,c_889]) ).
cnf(c_2002,plain,
( ~ in(sK10,relation_dom(sK12))
| in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12) ),
inference(superposition,[status(thm)],[c_544,c_469]) ).
cnf(c_2003,plain,
in(unordered_pair(singleton(sK10),unordered_pair(sK10,sK11)),sK12),
inference(forward_subsumption_resolution,[status(thm)],[c_2002,c_971]) ).
cnf(c_2004,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2003,c_971,c_544,c_357]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU212+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 23 18:03:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.80/1.15 % SZS status Started for theBenchmark.p
% 2.80/1.15 % SZS status Theorem for theBenchmark.p
% 2.80/1.15
% 2.80/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.80/1.15
% 2.80/1.15 ------ iProver source info
% 2.80/1.15
% 2.80/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.80/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.80/1.15 git: non_committed_changes: false
% 2.80/1.15 git: last_make_outside_of_git: false
% 2.80/1.15
% 2.80/1.15 ------ Parsing...
% 2.80/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.80/1.15
% 2.80/1.15 ------ Preprocessing... sup_sim: 9 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 2.80/1.15
% 2.80/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.80/1.15
% 2.80/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.80/1.15 ------ Proving...
% 2.80/1.15 ------ Problem Properties
% 2.80/1.15
% 2.80/1.15
% 2.80/1.15 clauses 38
% 2.80/1.15 conjectures 1
% 2.80/1.15 EPR 16
% 2.80/1.15 Horn 34
% 2.80/1.15 unary 17
% 2.80/1.15 binary 15
% 2.80/1.15 lits 67
% 2.80/1.15 lits eq 11
% 2.80/1.15 fd_pure 0
% 2.80/1.15 fd_pseudo 0
% 2.80/1.15 fd_cond 1
% 2.80/1.15 fd_pseudo_cond 5
% 2.80/1.15 AC symbols 0
% 2.80/1.15
% 2.80/1.15 ------ Schedule dynamic 5 is on
% 2.80/1.15
% 2.80/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.80/1.15
% 2.80/1.15
% 2.80/1.15 ------
% 2.80/1.15 Current options:
% 2.80/1.15 ------
% 2.80/1.15
% 2.80/1.15
% 2.80/1.15
% 2.80/1.15
% 2.80/1.15 ------ Proving...
% 2.80/1.15
% 2.80/1.15
% 2.80/1.15 % SZS status Theorem for theBenchmark.p
% 2.80/1.15
% 2.80/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.80/1.15
% 2.80/1.15
%------------------------------------------------------------------------------