%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:23:33 PM UTC 2026
% Result : Theorem 2.01s 1.48s
% Output : CNFRefutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 65 ( 15 unt; 0 def)
% Number of atoms : 236 ( 35 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 287 ( 116 ~; 114 |; 43 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 195 ( 0 sgn 180 !; 15 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( path(X1,X2,X0)
=> ! [X3,X4] :
( ( ( ? [X5] :
( precedes(X5,X4,X0)
& sequential(X3,X5) )
| sequential(X3,X4) )
& on_path(X4,X0)
& on_path(X3,X0) )
=> precedes(X3,X4,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
fof(f11,axiom,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( ! [X3] :
( path(X0,X1,X3)
=> less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(f15,axiom,
! [X0,X1,X2] :
( path(X0,X1,X2)
=> number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
fof(f16,axiom,
! [X0,X1,X2] :
( ( ! [X3,X4] :
( ( sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0) )
=> ? [X5] : triangle(X3,X4,X5) )
& path(X1,X2,X0) )
=> number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(f17,axiom,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_has_them_all) ).
fof(f18,axiom,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( sequential(X2,X3)
& precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_is_triangle) ).
fof(f19,conjecture,
( complete
=> ! [X0,X1,X2] :
( shortest_path(X1,X2,X0)
=> less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_path_length) ).
fof(f20,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2] :
( shortest_path(X1,X2,X0)
=> less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
( ~ complete
| ! [X0,X1,X2,X3,X4] :
( ~ sequential(X2,X3)
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ? [X5] : triangle(X2,X3,X5) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
( ~ complete
| ! [X0,X1,X2,X3,X4] :
( ~ sequential(X2,X3)
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ? [X5] : triangle(X2,X3,X5) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
( complete
& ? [X0,X1,X2] :
( shortest_path(X1,X2,X0)
& ~ less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ( ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) )
& ~ sequential(X3,X4) )
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| precedes(X3,X4,X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ( ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) )
& ~ sequential(X3,X4) )
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| precedes(X3,X4,X0) ) ),
inference(flattening,[],[f27]) ).
fof(f31,plain,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( ! [X3] :
( ~ path(X0,X1,X3)
| less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0)
& ! [X5] : ~ triangle(X3,X4,X5) )
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( sequential(X3,X4)
& on_path(X4,X0)
& on_path(X3,X0)
& ! [X5] : ~ triangle(X3,X4,X5) )
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f37,plain,
( ~ complete
| ! [X0,X1,X2,X3,X4] :
( ~ sequential(X2,X3)
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| triangle(X2,X3,sK0(X2,X3)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X5,sK0(X2,X3))],[f22]) ).
fof(f38,plain,
( complete
& shortest_path(sK2,sK3,sK1)
& ~ less_or_equal(minus(length_of(sK1),n1),number_of_in(triangles,graph)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f23]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X3] :
( ~ path(X0,X1,X3)
| less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ? [X3] :
( path(X0,X1,X3)
& ~ less_or_equal(length_of(X2),length_of(X3)) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X3] :
( ~ path(X0,X1,X3)
| less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ? [X3] :
( path(X0,X1,X3)
& ~ less_or_equal(length_of(X2),length_of(X3)) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(flattening,[],[f48]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X4] :
( ~ path(X0,X1,X4)
| less_or_equal(length_of(X2),length_of(X4)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ? [X3] :
( path(X0,X1,X3)
& ~ less_or_equal(length_of(X2),length_of(X3)) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(rectify,[],[f49]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X4] :
( ~ path(X0,X1,X4)
| less_or_equal(length_of(X2),length_of(X4)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ( path(X0,X1,sK6(X0,X1,X2))
& ~ less_or_equal(length_of(X2),length_of(sK6(X0,X1,X2))) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X3,sK6(X0,X1,X2))],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( sequential(sK7(X0),sK8(X0))
& on_path(sK8(X0),X0)
& on_path(sK7(X0),X0)
& ! [X5] : ~ triangle(sK7(X0),sK8(X0),X5) )
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X3,sK7(X0)),skolemize(X4,sK8(X0))],[f33]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4] :
( ~ complete
| ~ sequential(X2,X3)
| ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| triangle(X2,X3,sK0(X2,X3)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f56,plain,
complete,
inference(cnf_transformation,[],[f38]) ).
fof(f57,plain,
shortest_path(sK2,sK3,sK1),
inference(cnf_transformation,[],[f38]) ).
fof(f58,plain,
~ less_or_equal(minus(length_of(sK1),n1),number_of_in(triangles,graph)),
inference(cnf_transformation,[],[f38]) ).
fof(f71,plain,
! [X2,X3,X0,X1,X4] :
( ~ path(X1,X2,X0)
| ~ sequential(X3,X4)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| precedes(X3,X4,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f81,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| path(X0,X1,X2) ),
inference(cnf_transformation,[],[f51]) ).
fof(f84,plain,
! [X2,X0,X1] :
( sequential(sK7(X0),sK8(X0))
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f85,plain,
! [X2,X0,X1] :
( on_path(sK8(X0),X0)
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f86,plain,
! [X2,X0,X1] :
( on_path(sK7(X0),X0)
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f87,plain,
! [X2,X0,X1,X5] :
( ~ triangle(sK7(X0),sK8(X0),X5)
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f95,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f96,plain,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
inference(cnf_transformation,[],[f17]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( triangle(X3,X4,sK0(X3,X4))
| ~ complete
| ~ sequential(X3,X4)
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_50,negated_conjecture,
~ less_or_equal(minus(length_of(sK1),n1),number_of_in(triangles,graph)),
inference(cnf_transformation,[],[f58]) ).
tcf(c_51,negated_conjecture,
shortest_path(sK2,sK3,sK1),
inference(cnf_transformation,[],[f57]) ).
tcf(c_52,negated_conjecture,
complete,
inference(cnf_transformation,[],[f56]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( precedes(X3,X4,X2)
| ~ on_path(X4,X2)
| ~ on_path(X3,X2)
| ~ sequential(X3,X4)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( path(X0,X1,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f81]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) )
| ~ path(X2,X3,X0)
| ~ triangle(sK7(X0),sK8(X0),X1) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i,X2: $i] :
( on_path(sK7(X2),X2)
| ( number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) )
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i,X2: $i] :
( on_path(sK8(X2),X2)
| ( number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) )
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] :
( sequential(sK7(X2),sK8(X2))
| ( number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) )
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( minus(length_of(X2),n1) = number_of_in(sequential_pairs,X2) )
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f95]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
inference(cnf_transformation,[],[f96]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( triangle(X3,X4,sK0(X3,X4))
| ~ shortest_path(X0,X1,X2)
| ~ precedes(X3,X4,X2)
| ~ sequential(X3,X4) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_52,c_49]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( triangle(X3,X4,sK0(X3,X4))
| ~ sequential(X3,X4)
| ~ precedes(X3,X4,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(renaming,[status(thm)],[c_119]) ).
tcf(c_2976,plain,
path(sK2,sK3,sK1),
inference(superposition,[status(thm)],[c_51,c_75]) ).
tcf(c_3001,plain,
minus(length_of(sK1),n1) = number_of_in(sequential_pairs,sK1),
inference(superposition,[status(thm)],[c_2976,c_89]) ).
tcf(c_3002,plain,
~ less_or_equal(number_of_in(sequential_pairs,sK1),number_of_in(triangles,graph)),
inference(demodulation,[status(thm)],[c_50,c_3001]) ).
tcf(c_3053,plain,
( on_path(sK7(sK1),sK1)
| ( number_of_in(triangles,sK1) = number_of_in(sequential_pairs,sK1) ) ),
inference(superposition,[status(thm)],[c_2976,c_79]) ).
tcf(c_3062,plain,
( on_path(sK8(sK1),sK1)
| ( number_of_in(triangles,sK1) = number_of_in(sequential_pairs,sK1) ) ),
inference(superposition,[status(thm)],[c_2976,c_80]) ).
tcf(c_3381,plain,
! [X0: $i,X1: $i] :
( precedes(X0,X1,sK1)
| ~ on_path(X1,sK1)
| ~ on_path(X0,sK1)
| ~ sequential(X0,X1) ),
inference(superposition,[status(thm)],[c_2976,c_64]) ).
tcf(c_3640,plain,
! [X0: $i,X1: $i] :
( triangle(X0,X1,sK0(X0,X1))
| ~ sequential(X0,X1)
| ~ precedes(X0,X1,sK1) ),
inference(superposition,[status(thm)],[c_51,c_120]) ).
tcf(c_3651,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) )
| ~ path(X1,X2,X0)
| ~ sequential(sK7(X0),sK8(X0))
| ~ precedes(sK7(X0),sK8(X0),sK1) ),
inference(superposition,[status(thm)],[c_3640,c_78]) ).
tcf(c_3790,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) )
| ~ path(X1,X2,X0)
| ~ precedes(sK7(X0),sK8(X0),sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3651,c_81]) ).
tcf(c_3800,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) )
| ~ on_path(sK8(X0),sK1)
| ~ on_path(sK7(X0),sK1)
| ~ path(X1,X2,X0)
| ~ sequential(sK7(X0),sK8(X0)) ),
inference(superposition,[status(thm)],[c_3381,c_3790]) ).
tcf(c_4279,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) )
| ~ on_path(sK8(X2),sK1)
| ~ on_path(sK7(X2),sK1)
| ~ path(X0,X1,X2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3800,c_81]) ).
tcf(c_4293,plain,
( ( number_of_in(triangles,sK1) = number_of_in(sequential_pairs,sK1) )
| ~ on_path(sK8(sK1),sK1)
| ~ on_path(sK7(sK1),sK1) ),
inference(superposition,[status(thm)],[c_2976,c_4279]) ).
tcf(c_4303,plain,
number_of_in(triangles,sK1) = number_of_in(sequential_pairs,sK1),
inference(global_subsumption_just,[status(thm)],[c_4293,c_3053,c_3062,c_4293]) ).
tcf(c_4310,plain,
~ less_or_equal(number_of_in(triangles,sK1),number_of_in(triangles,graph)),
inference(demodulation,[status(thm)],[c_3002,c_4303]) ).
tcf(c_4311,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4310,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 % Computer : n009.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.39 % CPULimit : 300
% 0.14/0.39 % WCLimit : 300
% 0.14/0.39 % DateTime : Wed Sep 23 12:42:13 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.48
% 0.17/0.48 % ======== iProver multi-core TPTP/SMT =========
% 0.17/0.48
% 0.17/0.48 % Detected problem language: tptp
% 0.17/0.50 % Proving...
% 2.01/1.48 % SZS status Started for theBenchmark.p
% 2.01/1.48 % SZS status Theorem for theBenchmark.p
% 2.01/1.48
% 2.01/1.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.01/1.48
% 2.01/1.48 % ------ iProver source info
% 2.01/1.48
% 2.01/1.48 % git: date: 2026-07-19 20:42:38 +0200
% 2.01/1.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.01/1.48 % git: non_committed_changes: false
% 2.01/1.48
% 2.01/1.48 % ------ Parsing...
% 2.01/1.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.01/1.48
% 2.01/1.48 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.01/1.48
% 2.01/1.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.01/1.48
% 2.01/1.48 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.01/1.48 % ------ Proving...
% 2.01/1.48 % ------ Problem Properties
% 2.01/1.48
% 2.01/1.48 %
% 2.01/1.48 % clauses 44
% 2.01/1.48 % conjectures 2
% 2.01/1.48 % EPR 19
% 2.01/1.48 % Horn 31
% 2.01/1.48 % unary 5
% 2.01/1.48 % binary 14
% 2.01/1.48 % lits 136
% 2.01/1.48 % lits eq 31
% 2.01/1.48 % fd_pure 0
% 2.01/1.48 % fd_pseudo 0
% 2.01/1.48 % fd_cond 0
% 2.01/1.48 % fd_pseudo_cond 5
% 2.01/1.48 % AC symbols 0
% 2.01/1.48
% 2.01/1.48 % ------ Schedule dynamic 5 is on
% 2.01/1.48
% 2.01/1.48 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.01/1.48
% 2.01/1.48
% 2.01/1.48 % ------
% 2.01/1.48 % Current options:
% 2.01/1.48 % ------
% 2.01/1.48
% 2.01/1.48
% 2.01/1.48 %
% 2.01/1.48
% 2.01/1.48 % ------ Proving...
% 2.01/1.48 %
% 2.01/1.48
% 2.01/1.48 % SZS status Theorem for theBenchmark.p
% 2.01/1.48
% 2.01/1.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.01/1.48
% 2.01/1.48
%------------------------------------------------------------------------------