%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HEN010-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:37:25 PM UTC 2026
% Result : Unsatisfiable 1.04s 1.18s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 11
% Syntax : Number of formulae : 93 ( 59 unt; 0 def)
% Number of atoms : 325 ( 55 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 100 ( 52 ~; 48 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 110 ( 0 sgn 110 !; 0 ?; 91 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_less_equal) ).
fof(f2,axiom,
! [X0,X1] :
( less_equal(X0,X1)
| ~ quotient(X0,X1,zero) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).
fof(f3,axiom,
! [X2,X0,X1] :
( less_equal(X2,X0)
| ~ quotient(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',divisor_existence) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( less_equal(X6,X7)
| ~ quotient(X2,X3,X7)
| ~ quotient(X5,X4,X6)
| ~ quotient(X0,X3,X5)
| ~ quotient(X1,X3,X4)
| ~ quotient(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',quotient_property) ).
fof(f5,axiom,
! [X0] : less_equal(zero,X0),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',zero_is_smallest) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_and_equal) ).
fof(f7,axiom,
! [X0] : less_equal(X0,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',identity_is_largest) ).
fof(f10,axiom,
quotient(identity,a,idQa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_a) ).
fof(f11,axiom,
quotient(identity,idQa,idQ_idQa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_idQa) ).
fof(f12,axiom,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity_divide_idQ_idQa) ).
fof(f13,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_idQa_equals_idQa_Q__idQ_idQa) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( quotient(X0,X1,zero)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ~ quotient(X0,X1,zero) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X2,X0)
| ~ quotient(X0,X1,X2) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( less_equal(X7,X6)
| ~ quotient(X4,X5,X7)
| ~ quotient(X2,X3,X6)
| ~ quotient(X1,X3,X5)
| ~ quotient(X0,X3,X4)
| ~ quotient(X0,X1,X2) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_66,plain,
! [X0: $i] : less_equal(zero,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ less_equal(X1,X0)
| ~ less_equal(X0,X1) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_68,plain,
! [X0: $i] : less_equal(X0,identity),
inference(cnf_transformation,[],[f7]) ).
tcf(c_71,plain,
quotient(identity,a,idQa),
inference(cnf_transformation,[],[f10]) ).
tcf(c_72,plain,
quotient(identity,idQa,idQ_idQa),
inference(cnf_transformation,[],[f11]) ).
tcf(c_73,plain,
quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),
inference(cnf_transformation,[],[f12]) ).
tcf(c_74,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
inference(cnf_transformation,[],[f13]) ).
tcf(c_83,plain,
divide(identity,a) = idQa,
inference(well_definedness,[status(thm)],[c_71]) ).
tcf(c_84,plain,
divide(identity,idQa) = idQ_idQa,
inference(well_definedness,[status(thm)],[c_72]) ).
tcf(c_85,plain,
divide(idQa,idQ_idQa) = idQa_Q__idQ_idQa,
inference(well_definedness,[status(thm)],[c_73]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(well_definedness,[status(thm)],[c_62]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(well_definedness,[status(thm)],[c_63]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X2,X0)
| ( divide(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_64]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i,X6: $i,X7: $i] :
( less_equal(X7,X6)
| ( divide(X4,X5) != X7 )
| ( divide(X2,X3) != X6 )
| ( divide(X1,X3) != X5 )
| ( divide(X0,X3) != X4 )
| ( divide(X0,X1) != X2 ) ),
inference(well_definedness,[status(thm)],[c_65]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( divide(X0,X1) != X2 )
| less_equal(X2,X0) ),
inference(prop_impl_just,[status(thm)],[c_88]) ).
tcf(c_103,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_equal(X2,X0)
| ( divide(X0,X1) != X2 ) ),
inference(renaming,[status(thm)],[c_102]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i] : less_equal(divide(X0,X1),X0),
inference(unflattening,[status(thm)],[c_103]) ).
tcf(c_196,plain,
! [X0: $i,X1: $i,X2: $i] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
inference(unflattening,[status(thm)],[c_90]) ).
tcf(c_204,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) != zero )
| less_equal(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_87]) ).
tcf(c_205,plain,
! [X0: $i,X1: $i] :
( less_equal(X0,X1)
| ( divide(X0,X1) != zero ) ),
inference(renaming,[status(thm)],[c_204]) ).
tcf(c_206,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = zero )
| ~ less_equal(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_86]) ).
tcf(c_271,negated_conjecture,
idQa != idQa_Q__idQ_idQa,
inference(demodulation,[status(thm)],[c_74]) ).
tcf(c_444,plain,
less_equal(idQa_Q__idQ_idQa,idQa),
inference(superposition,[status(thm)],[c_85,c_182]) ).
tcf(c_448,plain,
! [X0: $i] :
( ( X0 = zero )
| ~ less_equal(X0,zero) ),
inference(superposition,[status(thm)],[c_66,c_67]) ).
tcf(c_450,plain,
! [X0: $i,X1: $i] :
( ( divide(X0,X1) = X0 )
| ~ less_equal(X0,divide(X0,X1)) ),
inference(superposition,[status(thm)],[c_182,c_67]) ).
tcf(c_451,plain,
( ( idQa = idQa_Q__idQ_idQa )
| ~ less_equal(idQa,idQa_Q__idQ_idQa) ),
inference(superposition,[status(thm)],[c_444,c_67]) ).
tcf(c_452,plain,
~ less_equal(idQa,idQa_Q__idQ_idQa),
inference(forward_subsumption_resolution,[status(thm)],[c_451,c_271]) ).
tcf(c_466,plain,
! [X0: $i] : divide(zero,X0) = zero,
inference(superposition,[status(thm)],[c_66,c_206]) ).
tcf(c_467,plain,
! [X0: $i] : divide(X0,identity) = zero,
inference(superposition,[status(thm)],[c_68,c_206]) ).
tcf(c_468,plain,
! [X0: $i,X1: $i] : divide(divide(X0,X1),X0) = zero,
inference(superposition,[status(thm)],[c_182,c_206]) ).
tcf(c_564,plain,
! [X0: $i] : less_equal(divide(idQa_Q__idQ_idQa,divide(X0,idQ_idQa)),divide(divide(idQa,X0),idQ_idQa)),
inference(superposition,[status(thm)],[c_85,c_196]) ).
tcf(c_569,plain,
! [X0: $i] : less_equal(divide(divide(X0,a),idQa),divide(divide(X0,identity),a)),
inference(superposition,[status(thm)],[c_83,c_196]) ).
tcf(c_570,plain,
! [X0: $i] : less_equal(divide(divide(X0,idQa),idQ_idQa),divide(divide(X0,identity),idQa)),
inference(superposition,[status(thm)],[c_84,c_196]) ).
tcf(c_572,plain,
! [X0: $i,X1: $i] : less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
inference(superposition,[status(thm)],[c_466,c_196]) ).
tcf(c_585,plain,
! [X0: $i,X1: $i,X2: $i] : divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
inference(superposition,[status(thm)],[c_196,c_206]) ).
tcf(c_586,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( divide(divide(X0,X2),divide(X1,X2)) = divide(divide(X0,X1),X2) )
| ~ less_equal(divide(divide(X0,X1),X2),divide(divide(X0,X2),divide(X1,X2))) ),
inference(superposition,[status(thm)],[c_196,c_67]) ).
tcf(c_594,plain,
! [X0: $i] : less_equal(divide(divide(X0,idQa),idQ_idQa),divide(zero,idQa)),
inference(light_normalisation,[status(thm)],[c_570,c_467]) ).
tcf(c_595,plain,
! [X0: $i] : less_equal(divide(divide(X0,a),idQa),divide(zero,a)),
inference(light_normalisation,[status(thm)],[c_569,c_467]) ).
tcf(c_650,plain,
! [X0: $i] : divide(divide(idQa,divide(X0,a)),divide(divide(identity,X0),a)) = zero,
inference(superposition,[status(thm)],[c_83,c_585]) ).
tcf(c_1050,plain,
! [X0: $i] : less_equal(divide(divide(X0,idQa),idQ_idQa),zero),
inference(demodulation,[status(thm)],[c_594,c_466]) ).
tcf(c_1058,plain,
! [X0: $i] : divide(divide(X0,idQa),idQ_idQa) = zero,
inference(superposition,[status(thm)],[c_1050,c_448]) ).
tcf(c_1172,plain,
! [X0: $i] : less_equal(divide(X0,idQa),idQ_idQa),
inference(superposition,[status(thm)],[c_1058,c_205]) ).
tcf(c_1182,plain,
! [X0: $i] :
( ( divide(divide(X0,idQ_idQa),divide(idQa,idQ_idQa)) = divide(divide(X0,idQa),idQ_idQa) )
| ~ less_equal(zero,divide(divide(X0,idQ_idQa),divide(idQa,idQ_idQa))) ),
inference(superposition,[status(thm)],[c_1058,c_586]) ).
tcf(c_1189,plain,
! [X0: $i] :
( ( divide(divide(X0,idQ_idQa),idQa_Q__idQ_idQa) = zero )
| ~ less_equal(zero,divide(divide(X0,idQ_idQa),idQa_Q__idQ_idQa)) ),
inference(light_normalisation,[status(thm)],[c_1182,c_85,c_1058]) ).
tcf(c_1190,plain,
! [X0: $i] : divide(divide(X0,idQ_idQa),idQa_Q__idQ_idQa) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_1189,c_66]) ).
tcf(c_1236,plain,
! [X0: $i] :
( ( divide(X0,idQa) = idQ_idQa )
| ~ less_equal(idQ_idQa,divide(X0,idQa)) ),
inference(superposition,[status(thm)],[c_1172,c_67]) ).
tcf(c_1251,plain,
! [X0: $i] : less_equal(divide(X0,idQ_idQa),idQa_Q__idQ_idQa),
inference(superposition,[status(thm)],[c_1190,c_205]) ).
tcf(c_1313,plain,
! [X0: $i] :
( ( divide(X0,idQ_idQa) = idQa_Q__idQ_idQa )
| ~ less_equal(idQa_Q__idQ_idQa,divide(X0,idQ_idQa)) ),
inference(superposition,[status(thm)],[c_1251,c_67]) ).
tcf(c_1468,plain,
! [X0: $i] : less_equal(divide(divide(X0,a),idQa),zero),
inference(demodulation,[status(thm)],[c_595,c_466]) ).
tcf(c_1475,plain,
! [X0: $i] : divide(divide(X0,a),idQa) = zero,
inference(superposition,[status(thm)],[c_1468,c_448]) ).
tcf(c_1635,plain,
! [X0: $i] : less_equal(divide(X0,a),idQa),
inference(superposition,[status(thm)],[c_1475,c_205]) ).
tcf(c_1648,plain,
! [X0: $i] :
( ( divide(divide(X0,idQa),divide(a,idQa)) = divide(divide(X0,a),idQa) )
| ~ less_equal(zero,divide(divide(X0,idQa),divide(a,idQa))) ),
inference(superposition,[status(thm)],[c_1475,c_586]) ).
tcf(c_1654,plain,
! [X0: $i] :
( ( divide(divide(X0,idQa),divide(a,idQa)) = zero )
| ~ less_equal(zero,divide(divide(X0,idQa),divide(a,idQa))) ),
inference(light_normalisation,[status(thm)],[c_1648,c_1475]) ).
tcf(c_1655,plain,
! [X0: $i] : divide(divide(X0,idQa),divide(a,idQa)) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_1654,c_66]) ).
tcf(c_1700,plain,
! [X0: $i] :
( ( divide(X0,a) = idQa )
| ~ less_equal(idQa,divide(X0,a)) ),
inference(superposition,[status(thm)],[c_1635,c_67]) ).
tcf(c_2357,plain,
! [X0: $i] : less_equal(divide(X0,idQa),divide(a,idQa)),
inference(superposition,[status(thm)],[c_1655,c_205]) ).
tcf(c_2430,plain,
less_equal(idQ_idQa,divide(a,idQa)),
inference(superposition,[status(thm)],[c_84,c_2357]) ).
tcf(c_2455,plain,
divide(a,idQa) = idQ_idQa,
inference(superposition,[status(thm)],[c_2430,c_1236]) ).
tcf(c_2498,plain,
divide(idQ_idQa,a) = zero,
inference(superposition,[status(thm)],[c_2455,c_468]) ).
tcf(c_3872,plain,
less_equal(divide(idQa_Q__idQ_idQa,divide(identity,idQ_idQa)),divide(zero,idQ_idQa)),
inference(superposition,[status(thm)],[c_467,c_564]) ).
tcf(c_3999,plain,
less_equal(divide(idQa_Q__idQ_idQa,divide(identity,idQ_idQa)),zero),
inference(demodulation,[status(thm)],[c_3872,c_466]) ).
tcf(c_4002,plain,
divide(idQa_Q__idQ_idQa,divide(identity,idQ_idQa)) = zero,
inference(superposition,[status(thm)],[c_3999,c_448]) ).
tcf(c_4008,plain,
less_equal(idQa_Q__idQ_idQa,divide(identity,idQ_idQa)),
inference(superposition,[status(thm)],[c_4002,c_205]) ).
tcf(c_4073,plain,
divide(identity,idQ_idQa) = idQa_Q__idQ_idQa,
inference(superposition,[status(thm)],[c_4008,c_1313]) ).
tcf(c_4097,plain,
divide(divide(idQa,divide(idQ_idQa,a)),divide(idQa_Q__idQ_idQa,a)) = zero,
inference(superposition,[status(thm)],[c_4073,c_650]) ).
tcf(c_4112,plain,
divide(divide(idQa,zero),divide(idQa_Q__idQ_idQa,a)) = zero,
inference(light_normalisation,[status(thm)],[c_4097,c_2498]) ).
tcf(c_4565,plain,
! [X0: $i,X1: $i] :
( ( divide(divide(X0,X1),zero) = divide(divide(X0,zero),X1) )
| ~ less_equal(divide(divide(X0,zero),X1),divide(divide(X0,X1),zero)) ),
inference(superposition,[status(thm)],[c_572,c_67]) ).
tcf(c_5386,plain,
( ( divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero) = divide(divide(idQa,zero),divide(idQa_Q__idQ_idQa,a)) )
| ~ less_equal(zero,divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero)) ),
inference(superposition,[status(thm)],[c_4112,c_4565]) ).
tcf(c_5455,plain,
( ( divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero) = zero )
| ~ less_equal(zero,divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero)) ),
inference(light_normalisation,[status(thm)],[c_5386,c_4112]) ).
tcf(c_5456,plain,
divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero) = zero,
inference(forward_subsumption_resolution,[status(thm)],[c_5455,c_66]) ).
tcf(c_5983,plain,
( ( divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero) = divide(idQa,divide(idQa_Q__idQ_idQa,a)) )
| ~ less_equal(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero) ),
inference(superposition,[status(thm)],[c_5456,c_450]) ).
tcf(c_5984,plain,
less_equal(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero),
inference(superposition,[status(thm)],[c_5456,c_205]) ).
tcf(c_6004,plain,
divide(divide(idQa,divide(idQa_Q__idQ_idQa,a)),zero) = divide(idQa,divide(idQa_Q__idQ_idQa,a)),
inference(forward_subsumption_resolution,[status(thm)],[c_5983,c_5984]) ).
tcf(c_6005,plain,
divide(idQa,divide(idQa_Q__idQ_idQa,a)) = zero,
inference(light_normalisation,[status(thm)],[c_6004,c_5456]) ).
tcf(c_6091,plain,
less_equal(idQa,divide(idQa_Q__idQ_idQa,a)),
inference(superposition,[status(thm)],[c_6005,c_205]) ).
tcf(c_6203,plain,
divide(idQa_Q__idQ_idQa,a) = idQa,
inference(superposition,[status(thm)],[c_6091,c_1700]) ).
tcf(c_6216,plain,
less_equal(idQa,idQa_Q__idQ_idQa),
inference(superposition,[status(thm)],[c_6203,c_182]) ).
tcf(c_6232,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6216,c_452]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN010-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n017.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 16:11:30 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 1.04/1.18 % SZS status Started for theBenchmark.p
% 1.04/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.04/1.18
% 1.04/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.04/1.18
% 1.04/1.18 % ------ iProver source info
% 1.04/1.18
% 1.04/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.04/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.04/1.18 % git: non_committed_changes: false
% 1.04/1.18
% 1.04/1.18 % ------ Parsing...% successful
% 1.04/1.18
% 1.04/1.18
% 1.04/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.04/1.18
% 1.04/1.18 % ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.04/1.18
% 1.04/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.04/1.18
% 1.04/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.04/1.18 % ------ Proving...
% 1.04/1.18 % ------ Problem Properties
% 1.04/1.18
% 1.04/1.18 %
% 1.04/1.18 % clauses 11
% 1.04/1.18 % conjectures 1
% 1.04/1.18 % EPR 4
% 1.04/1.18 % Horn 11
% 1.04/1.18 % unary 8
% 1.04/1.18 % binary 2
% 1.04/1.18 % lits 15
% 1.04/1.18 % lits eq 7
% 1.04/1.18 % fd_pure 0
% 1.04/1.18 % fd_pseudo 0
% 1.04/1.18 % fd_cond 0
% 1.04/1.18 % fd_pseudo_cond 1
% 1.04/1.18 % AC symbols 0
% 1.04/1.18
% 1.04/1.18 % ------ Schedule dynamic 5 is on
% 1.04/1.18
% 1.04/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.04/1.18
% 1.04/1.18
% 1.04/1.18 % ------
% 1.04/1.18 % Current options:
% 1.04/1.18 % ------
% 1.04/1.18
% 1.04/1.18
% 1.04/1.18 %
% 1.04/1.18
% 1.04/1.18 % ------ Proving...
% 1.04/1.18 %
% 1.04/1.18
% 1.04/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.04/1.18
% 1.04/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.04/1.18
% 1.04/1.18
%------------------------------------------------------------------------------