%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV997_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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 03:24:42 PM UTC 2026
% Result : Theorem 1.36s 1.16s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f16ERROR: Could not build tree for root c_656ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
z1: $int ).
tff(func_def_1,type,
z2: $int ).
tff(func_def_2,type,
z3: $int ).
tff(func_def_3,type,
z4: $int ).
tff(func_def_4,type,
a: $int > $int ).
tff(func_def_5,type,
b: $int > $int ).
tff(f17,plain,
~ ( ( ! [X14: $int,X15: $int,X16: $int] :
~ ( $less(X15,X14)
& $less(b(X15),3)
& ( 8 = a(X16) )
& ( 10 = a(X15) )
& ( 7 = a(X14) )
& ( X15 != X16 )
& ( X14 != X16 )
& ( X14 != X15 ) )
& ! [X11: $int,X12: $int,X13: $int] :
~ ( $less(X12,X11)
& ( 5 = b(X13) )
& $less(b(X12),3)
& ( 10 = a(X12) )
& ( 6 = a(X11) )
& ( X12 != X13 )
& ( X11 != X13 )
& ( X11 != X12 ) )
& ! [X8: $int,X9: $int,X10: $int] :
~ ( $less(X9,X8)
& ( 5 = b(X10) )
& $less(b(X9),3)
& ( 10 = a(X9) )
& ( 7 = a(X8) )
& ( X9 != X10 )
& ( X8 != X10 )
& ( X8 != X9 ) )
& ! [X6: $int,X7: $int] :
~ ( $less(X7,X6)
& $less(b(X7),3)
& ( 10 = a(X7) )
& ( 8 = a(X6) )
& ( X6 != X7 ) )
& ! [X4: $int,X5: $int] :
~ ( $less(X5,X4)
& $less(b(X5),3)
& ( 10 = a(X5) )
& ( 9 = a(X4) )
& ( X4 != X5 ) )
& ! [X2: $int,X3: $int] :
~ ( ( 10 = a(X3) )
& ( 10 = a(X2) )
& ( X2 != X3 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& ! [X1: $int] :
( ~ $less(5,b(X1))
& ~ $less(b(X1),1) )
& ! [X0: $int] :
( ~ $less(12,a(X0))
& ~ $less(a(X0),1) ) )
=> ~ ( $less(z2,z1)
& ( b(z3) = 5 )
& $less(b(z2),3)
& ( a(z3) = 1 )
& ( a(z2) = 10 )
& ( a(z1) = 6 ) ) ),
inference(true_and_false_elimination,[],[f16]) ).
tff(f18,plain,
( ! [X14: $int,X15: $int,X16: $int] :
( ~ $less(X15,X14)
| ~ $less(b(X15),3)
| ( 8 != a(X16) )
| ( 10 != a(X15) )
| ( 7 != a(X14) )
| ( X15 = X16 )
| ( X14 = X16 )
| ( X14 = X15 ) )
& ! [X11: $int,X12: $int,X13: $int] :
( ~ $less(X12,X11)
| ( 5 != b(X13) )
| ~ $less(b(X12),3)
| ( 10 != a(X12) )
| ( 6 != a(X11) )
| ( X12 = X13 )
| ( X11 = X13 )
| ( X11 = X12 ) )
& ! [X8: $int,X9: $int,X10: $int] :
( ~ $less(X9,X8)
| ( 5 != b(X10) )
| ~ $less(b(X9),3)
| ( 10 != a(X9) )
| ( 7 != a(X8) )
| ( X9 = X10 )
| ( X8 = X10 )
| ( X8 = X9 ) )
& ! [X6: $int,X7: $int] :
( ~ $less(X7,X6)
| ~ $less(b(X7),3)
| ( 10 != a(X7) )
| ( 8 != a(X6) )
| ( X6 = X7 ) )
& ! [X4: $int,X5: $int] :
( ~ $less(X5,X4)
| ~ $less(b(X5),3)
| ( 10 != a(X5) )
| ( 9 != a(X4) )
| ( X4 = X5 ) )
& ! [X2: $int,X3: $int] :
( ( 10 != a(X3) )
| ( 10 != a(X2) )
| ( X2 = X3 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& ! [X1: $int] :
( ~ $less(5,b(X1))
& ~ $less(b(X1),1) )
& ! [X0: $int] :
( ~ $less(12,a(X0))
& ~ $less(a(X0),1) )
& $less(z2,z1)
& ( b(z3) = 5 )
& $less(b(z2),3)
& ( a(z3) = 1 )
& ( a(z2) = 10 )
& ( a(z1) = 6 ) ),
inference(ennf_transformation,[],[f17]) ).
tff(f19,plain,
( ! [X14: $int,X15: $int,X16: $int] :
( ~ $less(X15,X14)
| ~ $less(b(X15),3)
| ( 8 != a(X16) )
| ( 10 != a(X15) )
| ( 7 != a(X14) )
| ( X15 = X16 )
| ( X14 = X16 )
| ( X14 = X15 ) )
& ! [X11: $int,X12: $int,X13: $int] :
( ~ $less(X12,X11)
| ( 5 != b(X13) )
| ~ $less(b(X12),3)
| ( 10 != a(X12) )
| ( 6 != a(X11) )
| ( X12 = X13 )
| ( X11 = X13 )
| ( X11 = X12 ) )
& ! [X8: $int,X9: $int,X10: $int] :
( ~ $less(X9,X8)
| ( 5 != b(X10) )
| ~ $less(b(X9),3)
| ( 10 != a(X9) )
| ( 7 != a(X8) )
| ( X9 = X10 )
| ( X8 = X10 )
| ( X8 = X9 ) )
& ! [X6: $int,X7: $int] :
( ~ $less(X7,X6)
| ~ $less(b(X7),3)
| ( 10 != a(X7) )
| ( 8 != a(X6) )
| ( X6 = X7 ) )
& ! [X4: $int,X5: $int] :
( ~ $less(X5,X4)
| ~ $less(b(X5),3)
| ( 10 != a(X5) )
| ( 9 != a(X4) )
| ( X4 = X5 ) )
& ! [X2: $int,X3: $int] :
( ( 10 != a(X3) )
| ( 10 != a(X2) )
| ( X2 = X3 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& ! [X1: $int] :
( ~ $less(5,b(X1))
& ~ $less(b(X1),1) )
& ! [X0: $int] :
( ~ $less(12,a(X0))
& ~ $less(a(X0),1) )
& $less(z2,z1)
& ( b(z3) = 5 )
& $less(b(z2),3)
& ( a(z3) = 1 )
& ( a(z2) = 10 )
& ( a(z1) = 6 ) ),
inference(flattening,[],[f18]) ).
tff(f21,plain,
! [X11: $int,X12: $int,X13: $int] :
( ~ $less(X12,X11)
| ( 5 != b(X13) )
| ~ $less(b(X12),3)
| ( 10 != a(X12) )
| ( 6 != a(X11) )
| ( X12 = X13 )
| ( X11 = X13 )
| ( X11 = X12 ) ),
inference(cnf_transformation,[],[f19]) ).
tff(f28,plain,
z2 != z3,
inference(cnf_transformation,[],[f19]) ).
tff(f30,plain,
z1 != z3,
inference(cnf_transformation,[],[f19]) ).
tff(f31,plain,
z1 != z2,
inference(cnf_transformation,[],[f19]) ).
tff(f36,plain,
$less(z2,z1),
inference(cnf_transformation,[],[f19]) ).
tff(f37,plain,
5 = b(z3),
inference(cnf_transformation,[],[f19]) ).
tff(f38,plain,
$less(b(z2),3),
inference(cnf_transformation,[],[f19]) ).
tff(f40,plain,
10 = a(z2),
inference(cnf_transformation,[],[f19]) ).
tff(f41,plain,
6 = a(z1),
inference(cnf_transformation,[],[f19]) ).
tcf(c_61,negated_conjecture,
a(z1) = 6,
inference(cnf_transformation,[],[f41]) ).
tcf(c_62,negated_conjecture,
a(z2) = 10,
inference(cnf_transformation,[],[f40]) ).
tcf(c_64,negated_conjecture,
$less(b(z2),3),
inference(cnf_transformation,[],[f38]) ).
tcf(c_65,negated_conjecture,
b(z3) = 5,
inference(cnf_transformation,[],[f37]) ).
tcf(c_66,negated_conjecture,
$less(z2,z1),
inference(cnf_transformation,[],[f36]) ).
tcf(c_71,negated_conjecture,
z1 != z2,
inference(cnf_transformation,[],[f31]) ).
tcf(c_72,negated_conjecture,
z1 != z3,
inference(cnf_transformation,[],[f30]) ).
tcf(c_74,negated_conjecture,
z2 != z3,
inference(cnf_transformation,[],[f28]) ).
tcf(c_81,negated_conjecture,
! [X0_int: $int,X1_int: $int,X2_int: $int] :
( ( X1_int = X2_int )
| ( X0_int = X2_int )
| ( X0_int = X1_int )
| ~ $less(X1_int,X0_int)
| ~ $less(b(X1_int),3)
| ( b(X2_int) != 5 )
| ( a(X1_int) != 10 )
| ( a(X0_int) != 6 ) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_382,plain,
! [X0_int: $int,X1_int: $int] :
( ( X1_int = z3 )
| ( X1_int = X0_int )
| ( X0_int = z3 )
| ~ $less(X0_int,X1_int)
| ~ $less(b(X0_int),3)
| ( a(X1_int) != 6 )
| ( a(X0_int) != 10 ) ),
inference(resolution,[status(thm)],[c_81,c_65]) ).
tcf(c_574,plain,
! [X0_int: $int] :
( ( z1 = z3 )
| ( z1 = X0_int )
| ( X0_int = z3 )
| ~ $less(X0_int,z1)
| ~ $less(b(X0_int),3)
| ( a(X0_int) != 10 ) ),
inference(resolution,[status(thm)],[c_382,c_61]) ).
tcf(c_608,plain,
! [X0_int: $int] :
( ( a(X0_int) != 10 )
| ~ $less(b(X0_int),3)
| ~ $less(X0_int,z1)
| ( X0_int = z3 )
| ( z1 = X0_int ) ),
inference(global_subsumption_just,[status(thm)],[c_574,c_72,c_574]) ).
tcf(c_609,plain,
! [X0_int: $int] :
( ( z1 = X0_int )
| ( X0_int = z3 )
| ~ $less(X0_int,z1)
| ~ $less(b(X0_int),3)
| ( a(X0_int) != 10 ) ),
inference(renaming,[status(thm)],[c_608]) ).
tcf(c_655,plain,
( ( z2 = z3 )
| ( z1 = z2 )
| ~ $less(z2,z1)
| ~ $less(b(z2),3) ),
inference(resolution,[status(thm)],[c_609,c_62]) ).
tcf(c_656,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_655,c_71,c_74,c_64,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV997_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 21:35:39 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.39 Running TFA theorem proving
% 0.10/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s tfa_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.40
% 0.10/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.40
% 0.10/0.40 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.36/1.16 % SZS status Started for theBenchmark.p
% 1.36/1.16 ERROR - "ProverProcess:heur/schedule_none:304.99998021125793" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.36/1.16 Fatal error: exception Failure("undefined enum value")
% 1.36/1.16 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --schedule none --sub_typing false --suppress_sat_res true --tptp_safe_out true --stats_out none --out_options none --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 101.67 --show_fool true" --time_out_real 305.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/h0fslbdn 2>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/h0fslbdn_error
% 1.36/1.16 ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.36/1.16 Fatal error: exception Failure("undefined enum value")
% 1.36/1.16 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 0 --comb_sup_mult 6 --conj_cone_tolerance 1.8969679945890683 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 512 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 3.67 --show_fool true" --time_out_real 11.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/ci21hrxm 2>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/ci21hrxm_error
% 1.36/1.16 ERROR - "ProverProcess:heur/vip_65097:3.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.36/1.16 Fatal error: exception Failure("undefined enum value")
% 1.36/1.16 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 3 --comb_sup_deep_mult 0 --comb_sup_mult 0 --conj_cone_tolerance 4.0357851670394345 --extra_neg_conj none --inst_activity_threshold 512 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp true --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 2048 --inst_lit_activity_flag true --inst_lit_sel "[+split;-sign;-depth]" --inst_lit_sel_side none --inst_orphan_elimination true --inst_passive_queue_type queue --inst_passive_queues "[[+age;+num_lits;-age];[-age;-min_def_symb;+bc_imp_inh]]" --inst_passive_queues_freq "[2;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 1.0 --inst_solver_per_active 1024 --inst_sos_flag true --inst_sos_phase false --inst_sos_sth_lit_sel "[+split;-ground;-depth]" --inst_start_prop_sim_after_learn 3 --inst_subs_given true --inst_subs_new false --instantiation_flag true --out_options none --prep_sup_sim_all true --prep_sup_sim_sup false --preprocessed_out false --preprocessing_flag true --prolific_symb_bound 256 --proof_out true --prop_solver_per_cl 16384 --resolution_flag true --schedule none --share_sel_clauses false --stats_out none --subs_bck_mult 8 --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 1.00 --show_fool true" --time_out_real 3.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/uq8byp5k 2>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/uq8byp5k_error
% 1.36/1.16 ERROR - "ProverProcess:heur/vip_65080:40.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.36/1.16 Fatal error: exception Failure("undefined enum value")
% 1.36/1.16 ERROR - cmd was: ulimit -v 4023281; ./res/iproveropt --comb_mode time_based --comb_res_mult 6 --comb_sup_deep_mult 4 --comb_sup_mult 6 --conj_cone_tolerance 1.895766803319499 --demod_completeness_check fullold --demod_use_ground false --extra_neg_conj all_pos_neg --instantiation_flag false --out_options none --preprocessed_out false --preprocessing_flag false --prolific_symb_bound 1024 --proof_out true --prop_solver_per_cl 128 --res_to_smt_solver false --resolution_flag true --schedule none --share_sel_clauses true --stats_out none --subs_bck_mult 16 --sup_bw_gjoin_interval 100 --sup_cache_sim none --sup_full_bw "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_full_fixpoint false --sup_full_fw "[]" --sup_fun_splitting false --sup_immed_bw_immed "[Subsumption;SubsumptionRes;UnitSubsAndRes]" --sup_immed_bw_main "[SubsumptionRes;UnitSubsAndRes;FullSubsAndRes;Demod;ACDemod]" --sup_immed_fixpoint false --sup_immed_fw_immed "[Subsumption;SubsumptionRes;FullSubsAndRes;Demod;LightNorm;ACDemod]" --sup_immed_fw_main "[Subsumption;UnitSubsAndRes;FullSubsAndRes;Demod;LightNorm;ACNormalisation;GroundJoinability;Connectedness]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_fixpoint false --sup_iter_deepening 2 --sup_main_fixpoint true --sup_ordering lpo --sup_passive_queue_type priority_queues --sup_passive_queues "[[+has_eq;-has_eq];[-num_var;-num_var];[+conj_dist;+ground;-max_atom_input_occur]]" --sup_passive_queues_freq "[1;4;4]" --sup_prop_simpl_given false --sup_prop_simpl_new false --sup_restarts_mult 4 --sup_score sim_d_gen --sup_share_max_num_cl 10 --sup_share_score_frac 0.2 --sup_smt_interval 32 --sup_symb_ordering invfreq_arity --sup_term_weight default --sup_to_prop_solver passive --sup_unprocessed_bound 10 --superposition_flag true --suppress_sat_res true --tptp_safe_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode tclausify -t 13.33 --show_fool true" --time_out_real 40.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/jmjtn7_m 2>> /export/starexec/sandbox/tmp/iprover_out_2bfme3gs/jmjtn7_m_error
% 1.36/1.16 % SZS status Theorem for theBenchmark.p
% 1.36/1.16
% 1.36/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.36/1.16
% 1.36/1.16 % ------ iProver source info
% 1.36/1.16
% 1.36/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.36/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.36/1.16 % git: non_committed_changes: false
% 1.36/1.16
% 1.36/1.16 % ------ Parsing...
% 1.36/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.36/1.16 % ------ Proving...
% 1.36/1.16 % ------ Problem Properties
% 1.36/1.16
% 1.36/1.16 %
% 1.36/1.16 % clauses 43
% 1.36/1.16 % conjectures 22
% 1.36/1.16 % EPR 19
% 1.36/1.16 % Horn 38
% 1.36/1.16 % unary 32
% 1.36/1.16 % binary 3
% 1.36/1.16 % lits 81
% 1.36/1.16 % lits eq 44
% 1.36/1.16 % fd_pure 0
% 1.36/1.16 % fd_pseudo 0
% 1.36/1.16 % fd_cond 0
% 1.36/1.16 % fd_pseudo_cond 7
% 1.36/1.16 % AC symbols 1
% 1.36/1.16
% 1.36/1.16 % ------ Input Options Time Limit: Unbounded
% 1.36/1.16
% 1.36/1.16
% 1.36/1.16 % ------
% 1.36/1.16 % Current options:
% 1.36/1.16 % ------
% 1.36/1.16
% 1.36/1.16
% 1.36/1.16 %
% 1.36/1.16
% 1.36/1.16 % ------ Proving...
% 1.36/1.16 %
% 1.36/1.16
% 1.36/1.16 % SZS status Theorem for theBenchmark.p
% 1.36/1.16
% 1.36/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.36/1.16
% 1.36/1.16
%------------------------------------------------------------------------------