%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWW600_2 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n007.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:30:03 PM UTC 2026
% Result : Theorem 1.41s 1.30s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 28 equ)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 77 ( 29 ~; 0 |; 39 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 182 ( 30 atm; 66 fun; 30 num; 56 var)
% Number of types : 2 ( 0 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 28 ( 25 usr; 14 con; 0-3 aty)
% Number of variables : 56 ( 0 sgn 34 !; 22 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
witness: ty > uni ).
tff(pred_def_1,type,
sort: ( uni * ty ) > $o ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(pred_def_4,type,
divides: ( $int * $int ) > $o ).
tff(pred_def_5,type,
even: $int > $o ).
tff(pred_def_6,type,
odd: $int > $o ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
abs: $int > $int ).
tff(func_def_14,type,
div: ( $int * $int ) > $int ).
tff(func_def_15,type,
mod: ( $int * $int ) > $int ).
tff(func_def_22,type,
gcd: ( $int * $int ) > $int ).
tff(func_def_23,type,
ref: ty > ty ).
tff(func_def_24,type,
mk_ref: ( uni * ty ) > uni ).
tff(func_def_25,type,
contents: ( uni * ty ) > uni ).
tff(func_def_27,type,
sK0: ( $int * $int ) > $int ).
tff(func_def_28,type,
sK1: $int > $int ).
tff(func_def_29,type,
sK2: $int > $int ).
tff(func_def_30,type,
sK3: ( $int * ( $int * $int ) ) > $int ).
tff(func_def_31,type,
sK4: $int ).
tff(func_def_32,type,
sK5: $int ).
tff(func_def_33,type,
sK6: $int ).
tff(func_def_34,type,
sK7: $int ).
tff(func_def_35,type,
sK8: $int ).
tff(func_def_36,type,
sK9: $int ).
tff(func_def_37,type,
sK10: $int ).
tff(func_def_38,type,
sK11: $int ).
tff(f83,conjecture,
! [X0: $int,X1: $int] :
( ( $lesseq(0,X1)
& $lesseq(0,X0) )
=> ! [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X7,X6) = gcd(X0,X1) )
& $lesseq(0,X6)
& $lesseq(0,X7) )
=> ( ~ $less(0,X6)
=> ? [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) = X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_gcd) ).
tff(f84,negated_conjecture,
~ ! [X0: $int,X1: $int] :
( ( $lesseq(0,X1)
& $lesseq(0,X0) )
=> ! [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X7,X6) = gcd(X0,X1) )
& $lesseq(0,X6)
& $lesseq(0,X7) )
=> ( ~ $less(0,X6)
=> ? [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) = X7 ) ) ) ),
inference(negated_conjecture,[status(cth)],[f83]) ).
tff(f106,plain,
~ ! [X0: $int,X1: $int] :
( ( ~ $less(X1,0)
& ~ $less(X0,0) )
=> ! [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X7,X6) = gcd(X0,X1) )
& ~ $less(X6,0)
& ~ $less(X7,0) )
=> ( ~ $less(0,X6)
=> ? [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) = X7 ) ) ) ),
inference(theory_normalization,[],[f84]) ).
tff(f203,plain,
? [X0: $int,X1: $int] :
( ~ $less(X1,0)
& ~ $less(X0,0)
& ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X7,X6) = gcd(X0,X1) )
& ~ $less(X6,0)
& ~ $less(X7,0)
& ~ $less(0,X6)
& ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 ) ) ),
inference(ennf_transformation,[],[f106]) ).
tff(f204,plain,
? [X0: $int,X1: $int] :
( ~ $less(X1,0)
& ~ $less(X0,0)
& ? [X2: $int,X3: $int,X4: $int,X5: $int,X6: $int,X7: $int] :
( ( $sum($product(X3,X0),$product(X2,X1)) = X6 )
& ( $sum($product(X5,X0),$product(X4,X1)) = X7 )
& ( gcd(X7,X6) = gcd(X0,X1) )
& ~ $less(X6,0)
& ~ $less(X7,0)
& ~ $less(0,X6)
& ! [X8: $int,X9: $int] : ( $sum($product(X8,X0),$product(X9,X1)) != X7 ) ) ),
inference(flattening,[],[f203]) ).
tff(f219,plain,
( ~ $less(sK5,0)
& ~ $less(sK4,0)
& ( sK10 = $sum($product(sK7,sK4),$product(sK6,sK5)) )
& ( sK11 = $sum($product(sK9,sK4),$product(sK8,sK5)) )
& ( gcd(sK4,sK5) = gcd(sK11,sK10) )
& ~ $less(sK10,0)
& ~ $less(sK11,0)
& ~ $less(0,sK10)
& ! [X8: $int,X9: $int] : ( sK11 != $sum($product(X8,sK4),$product(X9,sK5)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7),skolemize(X4,sK8),skolemize(X5,sK9),skolemize(X6,sK10),skolemize(X7,sK11)],[f204]) ).
tff(f317,plain,
sK11 = $sum($product(sK9,sK4),$product(sK8,sK5)),
inference(cnf_transformation,[],[f219]) ).
tff(f322,plain,
! [X8: $int,X9: $int] : ( sK11 != $sum($product(X8,sK4),$product(X9,sK5)) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_166,negated_conjecture,
! [X0_int: $int,X1_int: $int] : $sum($product(X0_int,sK4),$product(X1_int,sK5)) != sK11,
inference(cnf_transformation,[],[f322]) ).
tcf(c_171,negated_conjecture,
$sum($product(sK9,sK4),$product(sK8,sK5)) = sK11,
inference(cnf_transformation,[],[f317]) ).
tcf(c_667,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_171,c_166]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW600_2 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 22:43:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running TFA theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.41/1.30 % SZS status Started for theBenchmark.p
% 1.41/1.30 ERROR - "ProverProcess:heur/schedule_none:304.99997115135193" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.41/1.30 Fatal error: exception Failure("undefined enum value")
% 1.41/1.30 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_dndavuk1/ovjfockf 2>> /export/starexec/sandbox/tmp/iprover_out_dndavuk1/ovjfockf_error
% 1.41/1.30 ERROR - "ProverProcess:heur/vip_65520:11.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("undefined enum value")
% 1.41/1.30 Fatal error: exception Failure("undefined enum value")
% 1.41/1.30 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_dndavuk1/1idjlrx4 2>> /export/starexec/sandbox/tmp/iprover_out_dndavuk1/1idjlrx4_error
% 1.41/1.30 % SZS status Theorem for theBenchmark.p
% 1.41/1.30
% 1.41/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.41/1.30
% 1.41/1.30 % ------ iProver source info
% 1.41/1.30
% 1.41/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.41/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.41/1.30 % git: non_committed_changes: false
% 1.41/1.30
% 1.41/1.30 % ------ Parsing...
% 1.41/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.41/1.30
% 1.41/1.30 % ------ Preprocessing...%
% 1.41/1.30
% 1.41/1.30 % SZS status Theorem for theBenchmark.p
% 1.41/1.30
% 1.41/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.41/1.30
% 1.41/1.30
%------------------------------------------------------------------------------