TSTP Solution File: GEO126+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GEO126+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Fri May 3 02:16:29 EDT 2024
% Result : Theorem 7.73s 1.62s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 86 ( 22 unt; 0 def)
% Number of atoms : 301 ( 24 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 334 ( 119 ~; 113 |; 78 &)
% ( 12 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 189 ( 1 sgn 117 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X2,X0] :
( end_point(X2,X0)
<=> ( ! [X1,X3] :
( ( incident_c(X2,X3)
& incident_c(X2,X1)
& part_of(X3,X0)
& part_of(X1,X0) )
=> ( part_of(X3,X1)
| part_of(X1,X3) ) )
& incident_c(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',end_point_defn) ).
fof(f4,axiom,
! [X2,X0] :
( inner_point(X2,X0)
<=> ( ~ end_point(X2,X0)
& incident_c(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inner_point_defn) ).
fof(f7,axiom,
! [X0] :
( open(X0)
<=> ? [X2] : end_point(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',open_defn) ).
fof(f10,axiom,
! [X0] :
? [X2] : inner_point(X2,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c3) ).
fof(f19,axiom,
! [X2,X8] :
( start_point(X2,X8)
<=> ( ! [X4] :
( ( incident_o(X4,X8)
& X2 != X4 )
=> ordered_by(X8,X2,X4) )
& incident_o(X2,X8) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',start_point_defn) ).
fof(f22,axiom,
! [X8] :
? [X0] :
( ! [X2] :
( incident_o(X2,X8)
<=> incident_c(X2,X0) )
& open(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',o2) ).
fof(f24,axiom,
! [X8] :
? [X2] : start_point(X2,X8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',o4) ).
fof(f28,conjecture,
! [X8] :
? [X2,X4] :
( X2 != X4
& ordered_by(X8,X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_11) ).
fof(f29,negated_conjecture,
~ ! [X8] :
? [X2,X4] :
( X2 != X4
& ordered_by(X8,X2,X4) ),
inference(negated_conjecture,[],[f28]) ).
fof(f31,plain,
! [X0,X1] :
( end_point(X0,X1)
<=> ( ! [X2,X3] :
( ( incident_c(X0,X3)
& incident_c(X0,X2)
& part_of(X3,X1)
& part_of(X2,X1) )
=> ( part_of(X3,X2)
| part_of(X2,X3) ) )
& incident_c(X0,X1) ) ),
inference(rectify,[],[f3]) ).
fof(f32,plain,
! [X0,X1] :
( inner_point(X0,X1)
<=> ( ~ end_point(X0,X1)
& incident_c(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f35,plain,
! [X0] :
( open(X0)
<=> ? [X1] : end_point(X1,X0) ),
inference(rectify,[],[f7]) ).
fof(f37,plain,
! [X0] :
? [X1] : inner_point(X1,X0),
inference(rectify,[],[f10]) ).
fof(f45,plain,
! [X0,X1] :
( start_point(X0,X1)
<=> ( ! [X2] :
( ( incident_o(X2,X1)
& X0 != X2 )
=> ordered_by(X1,X0,X2) )
& incident_o(X0,X1) ) ),
inference(rectify,[],[f19]) ).
fof(f48,plain,
! [X0] :
? [X1] :
( ! [X2] :
( incident_o(X2,X0)
<=> incident_c(X2,X1) )
& open(X1) ),
inference(rectify,[],[f22]) ).
fof(f50,plain,
! [X0] :
? [X1] : start_point(X1,X0),
inference(rectify,[],[f24]) ).
fof(f54,plain,
~ ! [X0] :
? [X1,X2] :
( X1 != X2
& ordered_by(X0,X1,X2) ),
inference(rectify,[],[f29]) ).
fof(f55,plain,
! [X0,X1] :
( start_point(X0,X1)
=> ( ! [X2] :
( ( incident_o(X2,X1)
& X0 != X2 )
=> ordered_by(X1,X0,X2) )
& incident_o(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f58,plain,
! [X0,X1] :
( end_point(X0,X1)
<=> ( ! [X2,X3] :
( part_of(X3,X2)
| part_of(X2,X3)
| ~ incident_c(X0,X3)
| ~ incident_c(X0,X2)
| ~ part_of(X3,X1)
| ~ part_of(X2,X1) )
& incident_c(X0,X1) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f59,plain,
! [X0,X1] :
( end_point(X0,X1)
<=> ( ! [X2,X3] :
( part_of(X3,X2)
| part_of(X2,X3)
| ~ incident_c(X0,X3)
| ~ incident_c(X0,X2)
| ~ part_of(X3,X1)
| ~ part_of(X2,X1) )
& incident_c(X0,X1) ) ),
inference(flattening,[],[f58]) ).
fof(f75,plain,
! [X0,X1] :
( ( ! [X2] :
( ordered_by(X1,X0,X2)
| ~ incident_o(X2,X1)
| X0 = X2 )
& incident_o(X0,X1) )
| ~ start_point(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f76,plain,
! [X0,X1] :
( ( ! [X2] :
( ordered_by(X1,X0,X2)
| ~ incident_o(X2,X1)
| X0 = X2 )
& incident_o(X0,X1) )
| ~ start_point(X0,X1) ),
inference(flattening,[],[f75]) ).
fof(f81,plain,
? [X0] :
! [X1,X2] :
( X1 = X2
| ~ ordered_by(X0,X1,X2) ),
inference(ennf_transformation,[],[f54]) ).
fof(f91,plain,
! [X0,X1] :
( ( end_point(X0,X1)
| ? [X2,X3] :
( ~ part_of(X3,X2)
& ~ part_of(X2,X3)
& incident_c(X0,X3)
& incident_c(X0,X2)
& part_of(X3,X1)
& part_of(X2,X1) )
| ~ incident_c(X0,X1) )
& ( ( ! [X2,X3] :
( part_of(X3,X2)
| part_of(X2,X3)
| ~ incident_c(X0,X3)
| ~ incident_c(X0,X2)
| ~ part_of(X3,X1)
| ~ part_of(X2,X1) )
& incident_c(X0,X1) )
| ~ end_point(X0,X1) ) ),
inference(nnf_transformation,[],[f59]) ).
fof(f92,plain,
! [X0,X1] :
( ( end_point(X0,X1)
| ? [X2,X3] :
( ~ part_of(X3,X2)
& ~ part_of(X2,X3)
& incident_c(X0,X3)
& incident_c(X0,X2)
& part_of(X3,X1)
& part_of(X2,X1) )
| ~ incident_c(X0,X1) )
& ( ( ! [X2,X3] :
( part_of(X3,X2)
| part_of(X2,X3)
| ~ incident_c(X0,X3)
| ~ incident_c(X0,X2)
| ~ part_of(X3,X1)
| ~ part_of(X2,X1) )
& incident_c(X0,X1) )
| ~ end_point(X0,X1) ) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
! [X0,X1] :
( ( end_point(X0,X1)
| ? [X2,X3] :
( ~ part_of(X3,X2)
& ~ part_of(X2,X3)
& incident_c(X0,X3)
& incident_c(X0,X2)
& part_of(X3,X1)
& part_of(X2,X1) )
| ~ incident_c(X0,X1) )
& ( ( ! [X4,X5] :
( part_of(X5,X4)
| part_of(X4,X5)
| ~ incident_c(X0,X5)
| ~ incident_c(X0,X4)
| ~ part_of(X5,X1)
| ~ part_of(X4,X1) )
& incident_c(X0,X1) )
| ~ end_point(X0,X1) ) ),
inference(rectify,[],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ part_of(X3,X2)
& ~ part_of(X2,X3)
& incident_c(X0,X3)
& incident_c(X0,X2)
& part_of(X3,X1)
& part_of(X2,X1) )
=> ( ~ part_of(sK3(X0,X1),sK2(X0,X1))
& ~ part_of(sK2(X0,X1),sK3(X0,X1))
& incident_c(X0,sK3(X0,X1))
& incident_c(X0,sK2(X0,X1))
& part_of(sK3(X0,X1),X1)
& part_of(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f95,plain,
! [X0,X1] :
( ( end_point(X0,X1)
| ( ~ part_of(sK3(X0,X1),sK2(X0,X1))
& ~ part_of(sK2(X0,X1),sK3(X0,X1))
& incident_c(X0,sK3(X0,X1))
& incident_c(X0,sK2(X0,X1))
& part_of(sK3(X0,X1),X1)
& part_of(sK2(X0,X1),X1) )
| ~ incident_c(X0,X1) )
& ( ( ! [X4,X5] :
( part_of(X5,X4)
| part_of(X4,X5)
| ~ incident_c(X0,X5)
| ~ incident_c(X0,X4)
| ~ part_of(X5,X1)
| ~ part_of(X4,X1) )
& incident_c(X0,X1) )
| ~ end_point(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f93,f94]) ).
fof(f96,plain,
! [X0,X1] :
( ( inner_point(X0,X1)
| end_point(X0,X1)
| ~ incident_c(X0,X1) )
& ( ( ~ end_point(X0,X1)
& incident_c(X0,X1) )
| ~ inner_point(X0,X1) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f97,plain,
! [X0,X1] :
( ( inner_point(X0,X1)
| end_point(X0,X1)
| ~ incident_c(X0,X1) )
& ( ( ~ end_point(X0,X1)
& incident_c(X0,X1) )
| ~ inner_point(X0,X1) ) ),
inference(flattening,[],[f96]) ).
fof(f105,plain,
! [X0] :
( ( open(X0)
| ! [X1] : ~ end_point(X1,X0) )
& ( ? [X1] : end_point(X1,X0)
| ~ open(X0) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f106,plain,
! [X0] :
( ( open(X0)
| ! [X1] : ~ end_point(X1,X0) )
& ( ? [X2] : end_point(X2,X0)
| ~ open(X0) ) ),
inference(rectify,[],[f105]) ).
fof(f107,plain,
! [X0] :
( ? [X2] : end_point(X2,X0)
=> end_point(sK6(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
! [X0] :
( ( open(X0)
| ! [X1] : ~ end_point(X1,X0) )
& ( end_point(sK6(X0),X0)
| ~ open(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f106,f107]) ).
fof(f109,plain,
! [X0] :
( ? [X1] : inner_point(X1,X0)
=> inner_point(sK7(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
! [X0] : inner_point(sK7(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f37,f109]) ).
fof(f128,plain,
! [X0] :
? [X1] :
( ! [X2] :
( ( incident_o(X2,X0)
| ~ incident_c(X2,X1) )
& ( incident_c(X2,X1)
| ~ incident_o(X2,X0) ) )
& open(X1) ),
inference(nnf_transformation,[],[f48]) ).
fof(f129,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( ( incident_o(X2,X0)
| ~ incident_c(X2,X1) )
& ( incident_c(X2,X1)
| ~ incident_o(X2,X0) ) )
& open(X1) )
=> ( ! [X2] :
( ( incident_o(X2,X0)
| ~ incident_c(X2,sK14(X0)) )
& ( incident_c(X2,sK14(X0))
| ~ incident_o(X2,X0) ) )
& open(sK14(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
! [X0] :
( ! [X2] :
( ( incident_o(X2,X0)
| ~ incident_c(X2,sK14(X0)) )
& ( incident_c(X2,sK14(X0))
| ~ incident_o(X2,X0) ) )
& open(sK14(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f128,f129]) ).
fof(f136,plain,
! [X0] :
( ? [X1] : start_point(X1,X0)
=> start_point(sK17(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X0] : start_point(sK17(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17])],[f50,f136]) ).
fof(f148,plain,
( ? [X0] :
! [X1,X2] :
( X1 = X2
| ~ ordered_by(X0,X1,X2) )
=> ! [X2,X1] :
( X1 = X2
| ~ ordered_by(sK22,X1,X2) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X1,X2] :
( X1 = X2
| ~ ordered_by(sK22,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f81,f148]) ).
fof(f159,plain,
! [X0,X1] :
( incident_c(X0,X1)
| ~ end_point(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f167,plain,
! [X0,X1] :
( incident_c(X0,X1)
| ~ inner_point(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f168,plain,
! [X0,X1] :
( ~ end_point(X0,X1)
| ~ inner_point(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f169,plain,
! [X0,X1] :
( inner_point(X0,X1)
| end_point(X0,X1)
| ~ incident_c(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f178,plain,
! [X0] :
( end_point(sK6(X0),X0)
| ~ open(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f182,plain,
! [X0] : inner_point(sK7(X0),X0),
inference(cnf_transformation,[],[f110]) ).
fof(f205,plain,
! [X2,X0,X1] :
( ordered_by(X1,X0,X2)
| ~ incident_o(X2,X1)
| X0 = X2
| ~ start_point(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f208,plain,
! [X0] : open(sK14(X0)),
inference(cnf_transformation,[],[f130]) ).
fof(f209,plain,
! [X2,X0] :
( incident_c(X2,sK14(X0))
| ~ incident_o(X2,X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f210,plain,
! [X2,X0] :
( incident_o(X2,X0)
| ~ incident_c(X2,sK14(X0)) ),
inference(cnf_transformation,[],[f130]) ).
fof(f216,plain,
! [X0] : start_point(sK17(X0),X0),
inference(cnf_transformation,[],[f137]) ).
fof(f226,plain,
! [X2,X1] :
( X1 = X2
| ~ ordered_by(sK22,X1,X2) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_65,plain,
( ~ end_point(X0,X1)
| incident_c(X0,X1) ),
inference(cnf_transformation,[],[f159]) ).
cnf(c_66,plain,
( ~ incident_c(X0,X1)
| end_point(X0,X1)
| inner_point(X0,X1) ),
inference(cnf_transformation,[],[f169]) ).
cnf(c_67,plain,
( ~ end_point(X0,X1)
| ~ inner_point(X0,X1) ),
inference(cnf_transformation,[],[f168]) ).
cnf(c_68,plain,
( ~ inner_point(X0,X1)
| incident_c(X0,X1) ),
inference(cnf_transformation,[],[f167]) ).
cnf(c_78,plain,
( ~ open(X0)
| end_point(sK6(X0),X0) ),
inference(cnf_transformation,[],[f178]) ).
cnf(c_81,plain,
inner_point(sK7(X0),X0),
inference(cnf_transformation,[],[f182]) ).
cnf(c_103,plain,
( ~ incident_o(X0,X1)
| ~ start_point(X2,X1)
| X0 = X2
| ordered_by(X1,X2,X0) ),
inference(cnf_transformation,[],[f205]) ).
cnf(c_107,plain,
( ~ incident_c(X0,sK14(X1))
| incident_o(X0,X1) ),
inference(cnf_transformation,[],[f210]) ).
cnf(c_108,plain,
( ~ incident_o(X0,X1)
| incident_c(X0,sK14(X1)) ),
inference(cnf_transformation,[],[f209]) ).
cnf(c_109,plain,
open(sK14(X0)),
inference(cnf_transformation,[],[f208]) ).
cnf(c_115,plain,
start_point(sK17(X0),X0),
inference(cnf_transformation,[],[f216]) ).
cnf(c_125,negated_conjecture,
( ~ ordered_by(sK22,X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f226]) ).
cnf(c_1387,plain,
( sK17(X1) != X2
| X0 != X1
| ~ incident_o(X3,X0)
| X2 = X3
| ordered_by(X0,X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_103,c_115]) ).
cnf(c_1388,plain,
( ~ incident_o(X0,X1)
| sK17(X1) = X0
| ordered_by(X1,sK17(X1),X0) ),
inference(unflattening,[status(thm)],[c_1387]) ).
cnf(c_7125,negated_conjecture,
( ~ ordered_by(sK22,X0,X1)
| X0 = X1 ),
inference(demodulation,[status(thm)],[c_125]) ).
cnf(c_8824,plain,
incident_c(sK7(X0),X0),
inference(superposition,[status(thm)],[c_81,c_68]) ).
cnf(c_8829,plain,
( ~ open(X0)
| incident_c(sK6(X0),X0) ),
inference(superposition,[status(thm)],[c_78,c_65]) ).
cnf(c_8851,plain,
( ~ inner_point(sK6(X0),X0)
| ~ open(X0) ),
inference(superposition,[status(thm)],[c_78,c_67]) ).
cnf(c_8883,plain,
incident_o(sK7(sK14(X0)),X0),
inference(superposition,[status(thm)],[c_8824,c_107]) ).
cnf(c_8885,plain,
( ~ open(sK14(X0))
| incident_o(sK6(sK14(X0)),X0) ),
inference(superposition,[status(thm)],[c_8829,c_107]) ).
cnf(c_8888,plain,
incident_o(sK6(sK14(X0)),X0),
inference(forward_subsumption_resolution,[status(thm)],[c_8885,c_109]) ).
cnf(c_9028,plain,
( ~ incident_o(X0,X1)
| end_point(X0,sK14(X1))
| inner_point(X0,sK14(X1)) ),
inference(superposition,[status(thm)],[c_108,c_66]) ).
cnf(c_9549,plain,
( ~ incident_o(sK6(sK14(X0)),X0)
| ~ open(sK14(X0))
| end_point(sK6(sK14(X0)),sK14(X0)) ),
inference(superposition,[status(thm)],[c_9028,c_8851]) ).
cnf(c_9554,plain,
end_point(sK6(sK14(X0)),sK14(X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_9549,c_109,c_8888]) ).
cnf(c_9594,plain,
~ inner_point(sK6(sK14(X0)),sK14(X0)),
inference(superposition,[status(thm)],[c_9554,c_67]) ).
cnf(c_20487,plain,
( ~ incident_o(X0,sK22)
| sK17(sK22) = X0 ),
inference(superposition,[status(thm)],[c_1388,c_7125]) ).
cnf(c_20517,plain,
sK7(sK14(sK22)) = sK17(sK22),
inference(superposition,[status(thm)],[c_8883,c_20487]) ).
cnf(c_20519,plain,
sK6(sK14(sK22)) = sK17(sK22),
inference(superposition,[status(thm)],[c_8888,c_20487]) ).
cnf(c_21048,plain,
inner_point(sK17(sK22),sK14(sK22)),
inference(superposition,[status(thm)],[c_20517,c_81]) ).
cnf(c_21584,plain,
~ inner_point(sK17(sK22),sK14(sK22)),
inference(superposition,[status(thm)],[c_20519,c_9594]) ).
cnf(c_21588,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_21584,c_21048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GEO126+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 01:12:35 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.73/1.62 % SZS status Started for theBenchmark.p
% 7.73/1.62 % SZS status Theorem for theBenchmark.p
% 7.73/1.62
% 7.73/1.62 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.73/1.62
% 7.73/1.62 ------ iProver source info
% 7.73/1.62
% 7.73/1.62 git: date: 2024-05-02 19:28:25 +0000
% 7.73/1.62 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.73/1.62 git: non_committed_changes: false
% 7.73/1.62
% 7.73/1.62 ------ Parsing...
% 7.73/1.62 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.73/1.62
% 7.73/1.62 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 7.73/1.62
% 7.73/1.62 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.73/1.62
% 7.73/1.62 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.73/1.62 ------ Proving...
% 7.73/1.62 ------ Problem Properties
% 7.73/1.62
% 7.73/1.62
% 7.73/1.62 clauses 76
% 7.73/1.62 conjectures 1
% 7.73/1.62 EPR 25
% 7.73/1.62 Horn 48
% 7.73/1.62 unary 4
% 7.73/1.62 binary 29
% 7.73/1.62 lits 228
% 7.73/1.62 lits eq 22
% 7.73/1.62 fd_pure 0
% 7.73/1.62 fd_pseudo 0
% 7.73/1.62 fd_cond 0
% 7.73/1.62 fd_pseudo_cond 17
% 7.73/1.62 AC symbols 0
% 7.73/1.62
% 7.73/1.62 ------ Schedule dynamic 5 is on
% 7.73/1.62
% 7.73/1.62 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.73/1.62
% 7.73/1.62
% 7.73/1.62 ------
% 7.73/1.62 Current options:
% 7.73/1.62 ------
% 7.73/1.62
% 7.73/1.62
% 7.73/1.62
% 7.73/1.62
% 7.73/1.62 ------ Proving...
% 7.73/1.62
% 7.73/1.62
% 7.73/1.62 % SZS status Theorem for theBenchmark.p
% 7.73/1.62
% 7.73/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.73/1.62
% 7.73/1.63
%------------------------------------------------------------------------------