%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM183^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n019.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 : Wed Sep 30 07:46:30 AM UTC 2026
% Result : Theorem 0.19s 0.34s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM183^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 % Computer : n019.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 17:50:03 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.25 Running first-order model finding
% 0.08/0.25 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.34 % (1145387)Will run a generic schedule for satisfiability detection.
% 0.19/0.34 % (1145398)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3350443234:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.34 % (1145393)% WARNING: option uhcvi not known.
% 0.19/0.34 % (1145394)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=173883845:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.34 % (1145392)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4210283522_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.34 % (1145393)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=479313646:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.34 % (1145395)dis+10_1_sil=32000:sp=arity:random_seed=3296376893:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.34 % (1145396)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2302205568:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.34 % (1145397)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=801409148:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.34 % (1145393)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.34 % (1145396)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.34 % Exception at run slice level
% 0.19/0.34 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.34 % (1145393)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.19/0.34 % (1145398)Instruction limit reached!
% 0.19/0.34 % (1145398)------------------------------
% 0.19/0.34 % (1145398)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.34 % (1145398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.34 % (1145398)CaDiCaL version: 2.1.3
% 0.19/0.34 % (1145398)Termination reason: Instruction limit
% 0.19/0.34 % (1145398)Termination phase: Saturation
% 0.19/0.34 % (1145398)Time elapsed: 0.041 s
% 0.19/0.34 % (1145398)Peak memory usage: 13 MB
% 0.19/0.34 % (1145398)Instructions burned: 159 (million)
% 0.19/0.34 % (1145407)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3609080918:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.34 % (1145395)Instruction limit reached!
% 0.19/0.34 % (1145395)------------------------------
% 0.19/0.34 % (1145395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.34 % (1145395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.34 % (1145395)CaDiCaL version: 2.1.3
% 0.19/0.34 % (1145395)Termination reason: Instruction limit
% 0.19/0.34 % (1145395)Termination phase: Saturation
% 0.19/0.34 % (1145395)Time elapsed: 0.047 s
% 0.19/0.34 % (1145395)Peak memory usage: 12 MB
% 0.19/0.34 % (1145395)Instructions burned: 103 (million)
% 0.19/0.34 % (1145396) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145387-1145396"...
% 0.19/0.34 % (1145397) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1145387-1145397"...
% 0.19/0.34 % (1145397)...printing done.
% 0.19/0.34 % (1145396)...printing done.
% 0.19/0.34 % (1145397)Refutation found. Thanks to Tanya!
% 0.19/0.34 % SZS status Theorem for theBenchmark
% 0.19/0.34 % SZS output start Proof for theBenchmark
% 0.19/0.34 thf(type_def_5, type, dtree: $tType).
% 0.19/0.34 thf(type_def_6, type, set: $tType > $tType).
% 0.19/0.34 thf(type_def_7, type, t: $tType).
% 0.19/0.34 thf(type_def_8, type, n: $tType).
% 0.19/0.34 thf(type_def_9, type, itself: $tType > $tType).
% 0.19/0.34 thf(type_def_10, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.34 thf(func_def_0, type, bounded_lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_2, type, minus: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_3, type, uminus: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_4, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_5, type, ord: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_6, type, neg_numeral: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_7, type, order: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_8, type, group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_9, type, lattice: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_10, type, linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_11, type, preorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_12, type, order_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_13, type, linordered_idom: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_14, type, comm_monoid_diff: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_15, type, boolean_algebra: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_16, type, semilattice_sup: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_17, type, linordered_semidom: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_18, type, ordered_ab_group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_19, type, bounded_lattice_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_20, type, cancel1352612707id_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_21, type, cancel146912293up_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_22, type, linord219039673up_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_23, type, linord1659791738miring: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_24, type, bounde1808546759up_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_25, type, canoni770627133id_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.34 thf(func_def_26, type, root: (dtree > n)).
% 0.19/0.34 thf(func_def_27, type, gram_L861583724lle_Fr: (set @ n > dtree > set @ t)).
% 0.19/0.34 thf(func_def_28, type, gram_L1333338417e_inFr: (set @ n > dtree > t > $o)).
% 0.19/0.34 thf(func_def_29, type, gram_L805317441_inFr2: (set @ n > dtree > t > $o)).
% 0.19/0.34 thf(func_def_30, type, gram_L830233218_inItr: (set @ n > dtree > n > $o)).
% 0.19/0.34 thf(func_def_31, type, gram_L716654942_subtr: (set @ n > dtree > dtree > $o)).
% 0.19/0.34 thf(func_def_32, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.19/0.34 thf(func_def_33, type, one_one: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_34, type, uminus_uminus: !>[X0: $tType]:((X0 > X0))).
% 0.19/0.34 thf(func_def_35, type, zero_zero: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_36, type, semilattice_neutr: !>[X0: $tType]:(((X0 > X0 > X0) > X0 > $o))).
% 0.19/0.34 thf(func_def_37, type, sup_sup: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.19/0.34 thf(func_def_38, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_39, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.34 thf(func_def_40, type, order_antimono: !>[X0: $tType, X1: $tType]:(((X0 > X1) > $o))).
% 0.19/0.34 thf(func_def_41, type, order_strict_mono: !>[X0: $tType, X1: $tType]:(((X0 > X1) > $o))).
% 0.19/0.34 thf(func_def_42, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.19/0.34 thf(func_def_43, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.19/0.34 thf(func_def_44, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.19/0.34 thf(func_def_45, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 0.19/0.34 thf(func_def_46, type, pairwise: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > $o))).
% 0.19/0.34 thf(func_def_47, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.19/0.34 thf(func_def_48, type, ns: set @ n).
% 0.19/0.34 thf(func_def_49, type, tr1: dtree).
% 0.19/0.34 thf(func_def_50, type, tr2: dtree).
% 0.19/0.34 thf(func_def_51, type, tr3: dtree).
% 0.19/0.34 thf(func_def_55, type, vAND: ($o > $o > $o)).
% 0.19/0.34 thf(func_def_56, type, vOR: ($o > $o > $o)).
% 0.19/0.34 thf(func_def_57, type, db2: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_58, type, db0: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_59, type, db1: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_60, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.19/0.34 thf(func_def_61, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.19/0.34 thf(func_def_62, type, vIMP: ($o > $o > $o)).
% 0.19/0.34 thf(func_def_63, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.34 thf(func_def_64, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.19/0.34 thf(func_def_65, type, vNOT: ($o > $o)).
% 0.19/0.34 thf(func_def_66, type, db3: !>[X0: $tType]:(X0)).
% 0.19/0.34 thf(func_def_67, type, sP0: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.19/0.34 thf(func_def_68, type, sP1: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.19/0.34 thf(func_def_69, type, sP2: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.19/0.34 thf(func_def_70, type, sK3: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.19/0.34 thf(func_def_71, type, sK4: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_72, type, sK5: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_73, type, sK6: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_74, type, sK7: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_75, type, sK8: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_76, type, sK9: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_77, type, sK10: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_78, type, sK11: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_79, type, sK12: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_80, type, sK13: !>[X0: $tType]:(((X0 > X0 > X0) > X0))).
% 0.19/0.34 thf(func_def_81, type, sK14: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_82, type, sK15: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_83, type, sK16: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_84, type, sK17: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_85, type, sK18: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_86, type, sK19: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_87, type, sK20: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_88, type, sK21: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.19/0.34 thf(func_def_89, type, sK22: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.19/0.34 thf(func_def_90, type, sK23: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_91, type, sK24: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_92, type, sK25: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.19/0.34 thf(func_def_93, type, sK26: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.19/0.34 thf(func_def_94, type, sK27: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_95, type, sK28: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.19/0.34 thf(func_def_96, type, sK29: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.34 thf(func_def_97, type, sK30: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.34 thf(func_def_98, type, sK31: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.34 thf(func_def_99, type, sK32: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.34 thf(func_def_100, type, sK33: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_101, type, sK34: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_102, type, sK35: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 0.19/0.34 thf(func_def_103, type, sK36: !>[X0: $tType]:(((X0 > X0 > $o) > set @ X0 > X0))).
% 0.19/0.34 thf(func_def_104, type, sK37: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.19/0.34 thf(func_def_105, type, sK38: !>[X0: $tType]:(((X0 > $o) > set @ X0 > X0))).
% 0.19/0.34 thf(func_def_106, type, sK39: !>[X0: $tType]:((set @ X0 > set @ X0 > (X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_107, type, sK40: !>[X0: $tType]:((set @ X0 > (X0 > $o) > set @ X0 > X0))).
% 0.19/0.34 thf(func_def_108, type, sK41: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_109, type, sK42: !>[X0: $tType]:((set @ X0 > (X0 > $o) > X0))).
% 0.19/0.34 thf(func_def_110, type, sK43: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.34 thf(f1,axiom,(
% 0.19/0.34 (gram_L716654942_subtr @ (sup_sup @ set @ n @ ns @ ns) @ tr1 @ tr3)),
% 0.19/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__092_060open_062subtr_A_Ins_A_092_060union_062_Ans_J_Atr1_Atr3_092_060close_062)).
% 0.19/0.34 thf(f57,axiom,(
% 0.19/0.34 ! [X0 : $tType,X1 : set @ X0] : (((sup_sup @ set @ X0 @ X1 @ X1)) = X1)),
% 0.19/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_56_Un__absorb)).
% 0.19/0.34 thf(f297,conjecture,(
% 0.19/0.34 (gram_L716654942_subtr @ ns @ tr1 @ tr3)),
% 0.19/0.34 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.19/0.34 thf(f298,negated_conjecture,(
% 0.19/0.34 ~(gram_L716654942_subtr @ ns @ tr1 @ tr3)),
% 0.19/0.34 inference(negated_conjecture,[status(cth)],[f297])).
% 0.19/0.34 thf(f299,plain,(
% 0.19/0.34 (gram_L716654942_subtr @ (sup_sup @ set @ n @ ns @ ns) @ tr1 @ tr3)),
% 0.19/0.34 inference(rectify,[],[f1])).
% 0.19/0.34 thf(f300,plain,(
% 0.19/0.34 (((gram_L716654942_subtr @ (sup_sup @ set @ n @ ns @ ns) @ tr1 @ tr3)) = $true)),
% 0.19/0.34 inference(fool_elimination,[],[f299])).
% 0.19/0.34 thf(f833,plain,(
% 0.19/0.34 ~(gram_L716654942_subtr @ ns @ tr1 @ tr3)),
% 0.19/0.34 inference(rectify,[],[f298])).
% 0.19/0.34 thf(f834,plain,(
% 0.19/0.34 ~ (((gram_L716654942_subtr @ ns @ tr1 @ tr3)) = $true)),
% 0.19/0.34 inference(fool_elimination,[],[f833])).
% 0.19/0.34 thf(f860,plain,(
% 0.19/0.34 (((gram_L716654942_subtr @ ns @ tr1 @ tr3)) != $true)),
% 0.19/0.34 inference(flattening,[],[f834])).
% 0.19/0.34 thf(f1141,plain,(
% 0.19/0.34 (((gram_L716654942_subtr @ (sup_sup @ set @ n @ ns @ ns) @ tr1 @ tr3)) = $true)),
% 0.19/0.34 inference(cnf_transformation,[],[f300])).
% 0.19/0.34 thf(f1201,plain,(
% 0.19/0.34 ( ! [X0 : $tType,X1 : set @ X0] : ((((sup_sup @ set @ X0 @ X1 @ X1)) = X1)) )),
% 0.19/0.34 inference(cnf_transformation,[],[f57])).
% 0.19/0.34 thf(f1468,plain,(
% 0.19/0.34 (((gram_L716654942_subtr @ ns @ tr1 @ tr3)) != $true)),
% 0.19/0.34 inference(cnf_transformation,[],[f860])).
% 0.19/0.34 thf(f1799,plain,(
% 0.19/0.34 (((gram_L716654942_subtr @ ns @ tr1 @ tr3)) = $true)),
% 0.19/0.34 inference(forward_demodulation,[],[f1141,f1201])).
% 0.19/0.34 thf(f1800,plain,(
% 0.19/0.34 $false),
% 0.19/0.34 inference(forward_subsumption_resolution,[],[f1799,f1468])).
% 0.19/0.34 % SZS output end Proof for theBenchmark
% 0.19/0.34 % (1145397)------------------------------
% 0.19/0.34 % (1145397)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.34 % (1145397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.34 % (1145397)CaDiCaL version: 2.1.3
% 0.19/0.34 % (1145397)Termination reason: Refutation
% 0.19/0.34 % (1145397)Time elapsed: 0.050 s
% 0.19/0.34 % (1145397)Peak memory usage: 13 MB
% 0.19/0.34 % (1145397)Instructions burned: 110 (million)
% 0.19/0.34 % (1145387)Success in time 0.091 s
% 0.19/0.34 % Vampire exiting
%------------------------------------------------------------------------------