TSTP Solution File: SEU225+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU225+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 3.54s 1.13s
% Output : CNFRefutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 67 ( 9 unt; 0 def)
% Number of atoms : 313 ( 81 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 408 ( 162 ~; 159 |; 59 &)
% ( 12 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 140 ( 4 sgn; 100 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,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/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
fof(f16,axiom,
! [X0,X1] :
( relation(X0)
=> relation(relation_dom_restriction(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(f20,axiom,
! [X0,X1] :
( ( relation_empty_yielding(X0)
& relation(X0) )
=> ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc13_relat_1) ).
fof(f26,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(f31,axiom,
! [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(f43,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(f45,conjecture,
! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
fof(f46,negated_conjecture,
~ ! [X0,X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( in(X1,X0)
=> apply(relation_dom_restriction(X2,X0),X1) = apply(X2,X1) ) ),
inference(negated_conjecture,[],[f45]) ).
fof(f57,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,[],[f7]) ).
fof(f58,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,[],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f60,plain,
! [X0,X1] :
( ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f61,plain,
! [X0,X1] :
( ( relation_empty_yielding(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(flattening,[],[f60]) ).
fof(f64,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f65,plain,
! [X0,X1] :
( ( function(relation_dom_restriction(X0,X1))
& relation(relation_dom_restriction(X0,X1)) )
| ~ function(X0)
| ~ relation(X0) ),
inference(flattening,[],[f64]) ).
fof(f69,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,[],[f31]) ).
fof(f70,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,[],[f69]) ).
fof(f74,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,[],[f43]) ).
fof(f75,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,[],[f74]) ).
fof(f77,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& function(X2)
& relation(X2) ),
inference(ennf_transformation,[],[f46]) ).
fof(f78,plain,
? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& function(X2)
& relation(X2) ),
inference(flattening,[],[f77]) ).
fof(f81,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,[],[f58]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2)) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ function(X2)
| ~ relation(X2) ),
inference(nnf_transformation,[],[f70]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ( ( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2)) )
& ( ( in(X1,X0)
& in(X1,relation_dom(X2)) )
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X0))) ) )
| ~ function(X2)
| ~ relation(X2) ),
inference(flattening,[],[f84]) ).
fof(f102,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,[],[f75]) ).
fof(f103,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,[],[f102]) ).
fof(f104,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,[],[f103]) ).
fof(f105,plain,
! [X1,X2] :
( ? [X3] :
( apply(X1,X3) != apply(X2,X3)
& in(X3,relation_dom(X1)) )
=> ( apply(X1,sK9(X1,X2)) != apply(X2,sK9(X1,X2))
& in(sK9(X1,X2),relation_dom(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
! [X0,X1] :
( ! [X2] :
( ( ( relation_dom_restriction(X2,X0) = X1
| ( apply(X1,sK9(X1,X2)) != apply(X2,sK9(X1,X2))
& in(sK9(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,[sK9])],[f104,f105]) ).
fof(f107,plain,
( ? [X0,X1,X2] :
( apply(relation_dom_restriction(X2,X0),X1) != apply(X2,X1)
& in(X1,X0)
& function(X2)
& relation(X2) )
=> ( apply(relation_dom_restriction(sK12,sK10),sK11) != apply(sK12,sK11)
& in(sK11,sK10)
& function(sK12)
& relation(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
( apply(relation_dom_restriction(sK12,sK10),sK11) != apply(sK12,sK11)
& in(sK11,sK10)
& function(sK12)
& relation(sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f78,f107]) ).
fof(f118,plain,
! [X2,X0,X1] :
( empty_set = X2
| apply(X0,X1) != X2
| in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f121,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f126,plain,
! [X0,X1] :
( relation(relation_dom_restriction(X0,X1))
| ~ relation_empty_yielding(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f134,plain,
! [X0,X1] :
( function(relation_dom_restriction(X0,X1))
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f143,plain,
! [X2,X0,X1] :
( in(X1,relation_dom(relation_dom_restriction(X2,X0)))
| ~ in(X1,X0)
| ~ in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2) ),
inference(cnf_transformation,[],[f85]) ).
fof(f163,plain,
! [X2,X0,X1,X4] :
( apply(X1,X4) = apply(X2,X4)
| ~ in(X4,relation_dom(X1))
| relation_dom_restriction(X2,X0) != X1
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f106]) ).
fof(f167,plain,
relation(sK12),
inference(cnf_transformation,[],[f108]) ).
fof(f168,plain,
function(sK12),
inference(cnf_transformation,[],[f108]) ).
fof(f169,plain,
in(sK11,sK10),
inference(cnf_transformation,[],[f108]) ).
fof(f170,plain,
apply(relation_dom_restriction(sK12,sK10),sK11) != apply(sK12,sK11),
inference(cnf_transformation,[],[f108]) ).
fof(f177,plain,
! [X0,X1] :
( apply(X0,X1) = empty_set
| in(X1,relation_dom(X0))
| ~ function(X0)
| ~ relation(X0) ),
inference(equality_resolution,[],[f118]) ).
fof(f179,plain,
! [X2,X0,X4] :
( apply(X2,X4) = apply(relation_dom_restriction(X2,X0),X4)
| ~ in(X4,relation_dom(relation_dom_restriction(X2,X0)))
| ~ function(X2)
| ~ relation(X2)
| ~ function(relation_dom_restriction(X2,X0))
| ~ relation(relation_dom_restriction(X2,X0)) ),
inference(equality_resolution,[],[f163]) ).
cnf(c_55,plain,
( ~ function(X0)
| ~ relation(X0)
| apply(X0,X1) = empty_set
| in(X1,relation_dom(X0)) ),
inference(cnf_transformation,[],[f177]) ).
cnf(c_58,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f121]) ).
cnf(c_64,plain,
( ~ relation(X0)
| ~ relation_empty_yielding(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_70,plain,
( ~ function(X0)
| ~ relation(X0)
| function(relation_dom_restriction(X0,X1)) ),
inference(cnf_transformation,[],[f134]) ).
cnf(c_78,plain,
( ~ in(X0,relation_dom(X1))
| ~ in(X0,X2)
| ~ function(X1)
| ~ relation(X1)
| in(X0,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_101,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ function(relation_dom_restriction(X1,X2))
| ~ relation(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(cnf_transformation,[],[f179]) ).
cnf(c_104,negated_conjecture,
apply(relation_dom_restriction(sK12,sK10),sK11) != apply(sK12,sK11),
inference(cnf_transformation,[],[f170]) ).
cnf(c_105,negated_conjecture,
in(sK11,sK10),
inference(cnf_transformation,[],[f169]) ).
cnf(c_106,negated_conjecture,
function(sK12),
inference(cnf_transformation,[],[f168]) ).
cnf(c_107,negated_conjecture,
relation(sK12),
inference(cnf_transformation,[],[f167]) ).
cnf(c_140,plain,
( ~ relation(X0)
| relation(relation_dom_restriction(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_64,c_58]) ).
cnf(c_235,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_101,c_140]) ).
cnf(c_271,plain,
( ~ in(X0,relation_dom(relation_dom_restriction(X1,X2)))
| ~ function(X1)
| ~ relation(X1)
| apply(relation_dom_restriction(X1,X2),X0) = apply(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_235,c_70]) ).
cnf(c_939,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_1932,plain,
( apply(relation_dom_restriction(sK12,sK10),sK11) != X0
| apply(sK12,sK11) != X0
| apply(relation_dom_restriction(sK12,sK10),sK11) = apply(sK12,sK11) ),
inference(instantiation,[status(thm)],[c_939]) ).
cnf(c_1933,plain,
( apply(relation_dom_restriction(sK12,sK10),sK11) != empty_set
| apply(sK12,sK11) != empty_set
| apply(relation_dom_restriction(sK12,sK10),sK11) = apply(sK12,sK11) ),
inference(instantiation,[status(thm)],[c_1932]) ).
cnf(c_2010,plain,
( ~ in(sK11,relation_dom(X0))
| ~ in(sK11,sK10)
| ~ function(X0)
| ~ relation(X0)
| in(sK11,relation_dom(relation_dom_restriction(X0,sK10))) ),
inference(instantiation,[status(thm)],[c_78]) ).
cnf(c_2505,plain,
( ~ function(sK12)
| ~ relation(sK12)
| function(relation_dom_restriction(sK12,sK10)) ),
inference(instantiation,[status(thm)],[c_70]) ).
cnf(c_2527,plain,
( ~ function(sK12)
| ~ relation(sK12)
| apply(sK12,sK11) = empty_set
| in(sK11,relation_dom(sK12)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_3963,plain,
( ~ relation(sK12)
| relation(relation_dom_restriction(sK12,sK10)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_4161,plain,
( ~ function(relation_dom_restriction(sK12,sK10))
| ~ relation(relation_dom_restriction(sK12,sK10))
| apply(relation_dom_restriction(sK12,sK10),sK11) = empty_set
| in(sK11,relation_dom(relation_dom_restriction(sK12,sK10))) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_4765,plain,
( ~ in(sK11,relation_dom(sK12))
| ~ in(sK11,sK10)
| ~ function(sK12)
| ~ relation(sK12)
| in(sK11,relation_dom(relation_dom_restriction(sK12,sK10))) ),
inference(instantiation,[status(thm)],[c_2010]) ).
cnf(c_6990,plain,
( ~ in(sK11,relation_dom(relation_dom_restriction(sK12,sK10)))
| ~ function(sK12)
| ~ relation(sK12)
| apply(relation_dom_restriction(sK12,sK10),sK11) = apply(sK12,sK11) ),
inference(instantiation,[status(thm)],[c_271]) ).
cnf(c_6993,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6990,c_4765,c_4161,c_3963,c_2527,c_2505,c_1933,c_104,c_105,c_106,c_107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU225+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 20:30:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.54/1.13 % SZS status Started for theBenchmark.p
% 3.54/1.13 % SZS status Theorem for theBenchmark.p
% 3.54/1.13
% 3.54/1.13 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.54/1.13
% 3.54/1.13 ------ iProver source info
% 3.54/1.13
% 3.54/1.13 git: date: 2023-05-31 18:12:56 +0000
% 3.54/1.13 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.54/1.13 git: non_committed_changes: false
% 3.54/1.13 git: last_make_outside_of_git: false
% 3.54/1.13
% 3.54/1.13 ------ Parsing...
% 3.54/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.54/1.13
% 3.54/1.13 ------ Preprocessing... sup_sim: 2 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
% 3.54/1.13
% 3.54/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.54/1.13
% 3.54/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.54/1.13 ------ Proving...
% 3.54/1.13 ------ Problem Properties
% 3.54/1.13
% 3.54/1.13
% 3.54/1.13 clauses 49
% 3.54/1.13 conjectures 4
% 3.54/1.13 EPR 25
% 3.54/1.13 Horn 46
% 3.54/1.13 unary 26
% 3.54/1.13 binary 9
% 3.54/1.13 lits 103
% 3.54/1.13 lits eq 16
% 3.54/1.13 fd_pure 0
% 3.54/1.13 fd_pseudo 0
% 3.54/1.13 fd_cond 1
% 3.54/1.13 fd_pseudo_cond 4
% 3.54/1.13 AC symbols 0
% 3.54/1.13
% 3.54/1.13 ------ Schedule dynamic 5 is on
% 3.54/1.13
% 3.54/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.54/1.13
% 3.54/1.13
% 3.54/1.13 ------
% 3.54/1.13 Current options:
% 3.54/1.13 ------
% 3.54/1.13
% 3.54/1.13
% 3.54/1.13
% 3.54/1.13
% 3.54/1.13 ------ Proving...
% 3.54/1.13
% 3.54/1.13
% 3.54/1.13 % SZS status Theorem for theBenchmark.p
% 3.54/1.13
% 3.54/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.54/1.13
% 3.54/1.13
%------------------------------------------------------------------------------