↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : COM182^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 : n015.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.30s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COM182^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.17  % Computer : n015.cluster.edu
% 0.07/0.17  % Model    : x86_64 x86_64
% 0.07/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17  % Memory   : 8046.5625MB
% 0.07/0.17  % OS       : Linux 6.8.0-71-generic
% 0.07/0.17  % CPULimit : 300
% 0.07/0.17  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 17:53:04 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.21  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.30  % (3880440)Will run a generic schedule for satisfiability detection.
% 0.19/0.30  % (3880447)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1644095469:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.30  % (3880446)% WARNING: option uhcvi not known.
% 0.19/0.30  % (3880445)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=685373004_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.30  % (3880446)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=912719635:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.30  % (3880448)dis+10_1_sil=32000:sp=arity:random_seed=2580710092:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.30  % (3880450)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2271593114:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30  % (3880449)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2287468765:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.30  % (3880451)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=316085599:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.30  % (3880446)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.30  % (3880449)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.19/0.30  % (3880447) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3880440-3880447"...
% 0.19/0.30  % (3880447)...printing done.
% 0.19/0.30  % (3880447)Refutation found. Thanks to Tanya!
% 0.19/0.30  % SZS status Theorem for theBenchmark
% 0.19/0.30  % SZS output start Proof for theBenchmark
% 0.19/0.30  thf(type_def_5, type, sum_sum: ($tType * $tType) > $tType).
% 0.19/0.30  thf(type_def_6, type, dtree: $tType).
% 0.19/0.30  thf(type_def_7, type, fset: $tType > $tType).
% 0.19/0.30  thf(type_def_8, type, set: $tType > $tType).
% 0.19/0.30  thf(type_def_9, type, t: $tType).
% 0.19/0.30  thf(type_def_10, type, n: $tType).
% 0.19/0.30  thf(type_def_11, type, itself: $tType > $tType).
% 0.19/0.30  thf(type_def_12, type, sTfun: ($tType * $tType) > $tType).
% 0.19/0.30  thf(func_def_0, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_1, type, minus: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_2, type, group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_3, type, finite_finite: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_4, type, linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_5, type, semilattice_sup: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_6, type, ordered_ab_group_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_7, type, cancel146912293up_add: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.19/0.30  thf(func_def_8, type, basic_setl: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > set @ X0))).
% 0.19/0.30  thf(func_def_9, type, basic_setr: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > set @ X1))).
% 0.19/0.30  thf(func_def_10, type, node: (n > set @ sum_sum @ t @ dtree > dtree)).
% 0.19/0.30  thf(func_def_11, type, cont: (dtree > set @ sum_sum @ t @ dtree)).
% 0.19/0.30  thf(func_def_12, type, corec: !>[X0: $tType]:(((X0 > n) > (X0 > set @ sum_sum @ t @ sum_sum @ dtree @ X0) > X0 > dtree))).
% 0.19/0.30  thf(func_def_13, type, nNode: (n > fset @ sum_sum @ t @ dtree > dtree)).
% 0.19/0.30  thf(func_def_14, type, case_dtree: !>[X0: $tType]:(((n > fset @ sum_sum @ t @ dtree > X0) > dtree > X0))).
% 0.19/0.30  thf(func_def_15, type, ccont: (dtree > fset @ sum_sum @ t @ dtree)).
% 0.19/0.30  thf(func_def_16, type, root: (dtree > n)).
% 0.19/0.30  thf(func_def_17, type, unfold: !>[X0: $tType]:(((X0 > n) > (X0 > set @ sum_sum @ t @ X0) > X0 > dtree))).
% 0.19/0.30  thf(func_def_18, type, finite_finite2: !>[X0: $tType]:((set @ X0 > $o))).
% 0.19/0.30  thf(func_def_19, type, comp: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X0) > X2 > X1))).
% 0.19/0.30  thf(func_def_20, type, gram_L1333338417e_inFr: (set @ n > dtree > t > $o)).
% 0.19/0.30  thf(func_def_21, type, gram_L805317441_inFr2: (set @ n > dtree > t > $o)).
% 0.19/0.30  thf(func_def_22, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.19/0.30  thf(func_def_23, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.19/0.30  thf(func_def_24, type, lattic477160up_fin: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_25, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_26, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.30  thf(func_def_27, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.30  thf(func_def_28, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.19/0.30  thf(func_def_29, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_30, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.19/0.30  thf(func_def_31, type, is_empty: !>[X0: $tType]:((set @ X0 > $o))).
% 0.19/0.30  thf(func_def_32, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 0.19/0.30  thf(func_def_33, type, remove: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.19/0.30  thf(func_def_34, type, the_elem: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_35, type, sum_Inl: !>[X0: $tType, X1: $tType]:((X0 > sum_sum @ X0 @ X1))).
% 0.19/0.30  thf(func_def_36, type, sum_Inr: !>[X0: $tType, X1: $tType]:((X0 > sum_sum @ X1 @ X0))).
% 0.19/0.30  thf(func_def_37, type, sum_Plus: !>[X0: $tType, X1: $tType]:((set @ X0 > set @ X1 > set @ sum_sum @ X0 @ X1))).
% 0.19/0.30  thf(func_def_38, type, sum_Suml: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > sum_sum @ X0 @ X2 > X1))).
% 0.19/0.30  thf(func_def_39, type, sum_Sumr: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > sum_sum @ X2 @ X0 > X1))).
% 0.19/0.30  thf(func_def_40, type, sum_rec_sum: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X1) > sum_sum @ X0 @ X2 > X1))).
% 0.19/0.30  thf(func_def_41, type, sum_case_sum: !>[X0: $tType, X1: $tType, X2: $tType]:(((X0 > X1) > (X2 > X1) > sum_sum @ X0 @ X2 > X1))).
% 0.19/0.30  thf(func_def_42, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.19/0.30  thf(func_def_43, type, nsa: set @ n).
% 0.19/0.30  thf(func_def_44, type, ta: t).
% 0.19/0.30  thf(func_def_45, type, tra: dtree).
% 0.19/0.30  thf(func_def_47, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.19/0.30  thf(func_def_50, type, vOR: ($o > $o > $o)).
% 0.19/0.30  thf(func_def_51, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.19/0.30  thf(func_def_52, type, vAND: ($o > $o > $o)).
% 0.19/0.30  thf(func_def_53, type, db5: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_54, type, db1: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_55, type, db4: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_56, type, db0: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_57, type, db3: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_58, type, db2: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_59, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.19/0.30  thf(func_def_60, type, db6: !>[X0: $tType]:(X0)).
% 0.19/0.30  thf(func_def_61, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.19/0.30  thf(func_def_62, type, vIMP: ($o > $o > $o)).
% 0.19/0.30  thf(func_def_63, type, vNOT: ($o > $o)).
% 0.19/0.30  thf(func_def_64, type, sP0: ((set @ n > dtree > t > $o) > $o)).
% 0.19/0.30  thf(func_def_65, type, sP1: ((set @ n > dtree > t > $o) > $o)).
% 0.19/0.30  thf(func_def_66, type, sP2: !>[X0: $tType]:((set @ X0 > (set @ X0 > $o) > $o))).
% 0.19/0.30  thf(func_def_67, type, sK3: (t > dtree > set @ n > dtree)).
% 0.19/0.30  thf(func_def_68, type, sK4: ((set @ n > dtree > t > $o) > dtree)).
% 0.19/0.30  thf(func_def_69, type, sK5: ((set @ n > dtree > t > $o) > set @ n)).
% 0.19/0.30  thf(func_def_70, type, sK6: ((set @ n > dtree > t > $o) > dtree)).
% 0.19/0.30  thf(func_def_71, type, sK7: ((set @ n > dtree > t > $o) > t)).
% 0.19/0.30  thf(func_def_72, type, sK8: ((set @ n > dtree > t > $o) > dtree)).
% 0.19/0.30  thf(func_def_73, type, sK9: ((set @ n > dtree > t > $o) > set @ n)).
% 0.19/0.30  thf(func_def_74, type, sK10: ((set @ n > dtree > t > $o) > t)).
% 0.19/0.30  thf(func_def_75, type, sK11: !>[X0: $tType, X1: $tType]:(((sum_sum @ X1 @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_76, type, sK12: !>[X0: $tType, X1: $tType]:(((sum_sum @ X1 @ X0 > $o) > X1))).
% 0.19/0.30  thf(func_def_77, type, sK13: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 0.19/0.30  thf(func_def_78, type, sK14: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 0.19/0.30  thf(func_def_79, type, sK15: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 0.19/0.30  thf(func_def_80, type, sK16: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 0.19/0.30  thf(func_def_81, type, sK17: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1))).
% 0.19/0.30  thf(func_def_82, type, sK18: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X0))).
% 0.19/0.30  thf(func_def_83, type, sK19: !>[X0: $tType, X1: $tType, X2: $tType]:(($o > (sum_sum @ X0 @ X1 > X2) > X2 > X1))).
% 0.19/0.30  thf(func_def_84, type, sK20: !>[X0: $tType, X1: $tType, X2: $tType]:(($o > (sum_sum @ X0 @ X1 > X2) > X2 > X0))).
% 0.19/0.30  thf(func_def_85, type, sK21: ((set @ n > dtree > t > $o) > dtree)).
% 0.19/0.30  thf(func_def_86, type, sK22: ((set @ n > dtree > t > $o) > dtree)).
% 0.19/0.30  thf(func_def_87, type, sK23: ((set @ n > dtree > t > $o) > set @ n)).
% 0.19/0.30  thf(func_def_88, type, sK24: ((set @ n > dtree > t > $o) > t)).
% 0.19/0.30  thf(func_def_89, type, sK25: ((set @ n > dtree > t > $o) > dtree)).
% 0.19/0.30  thf(func_def_90, type, sK26: ((set @ n > dtree > t > $o) > set @ n)).
% 0.19/0.30  thf(func_def_91, type, sK27: ((set @ n > dtree > t > $o) > t)).
% 0.19/0.30  thf(func_def_92, type, sK28: (t > dtree > set @ n > dtree)).
% 0.19/0.30  thf(func_def_93, type, sK29: (t > dtree > set @ n > dtree)).
% 0.19/0.30  thf(func_def_94, type, sK30: (t > dtree > set @ n > set @ n)).
% 0.19/0.30  thf(func_def_95, type, sK31: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_96, type, sK32: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.19/0.30  thf(func_def_97, type, sK33: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.19/0.30  thf(func_def_98, type, sK34: (dtree > n)).
% 0.19/0.30  thf(func_def_99, type, sK35: (dtree > set @ sum_sum @ t @ dtree)).
% 0.19/0.30  thf(func_def_100, type, sK36: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.19/0.30  thf(func_def_101, type, sK37: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > set @ X1 > X1 > X0))).
% 0.19/0.30  thf(func_def_102, type, sK38: !>[X0: $tType, X1: $tType]:(((X1 > X0 > $o) > set @ X1 > X1))).
% 0.19/0.30  thf(func_def_103, type, sK39: !>[X0: $tType, X1: $tType]:((set @ X1 > sum_sum @ X0 @ X1 > X1))).
% 0.19/0.30  thf(func_def_104, type, sK40: !>[X0: $tType, X1: $tType]:((set @ X0 > sum_sum @ X0 @ X1 > X0))).
% 0.19/0.30  thf(func_def_105, type, sK41: (dtree > n)).
% 0.19/0.30  thf(func_def_106, type, sK42: (dtree > fset @ sum_sum @ t @ dtree)).
% 0.19/0.30  thf(func_def_107, type, sK43: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_108, type, sK44: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_109, type, sK45: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_110, type, sK46: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_111, type, sK47: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_112, type, sK48: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_113, type, sK49: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_114, type, sK50: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_115, type, sK51: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_116, type, sK52: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_117, type, sK53: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_118, type, sK54: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_119, type, sK55: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_120, type, sK56: !>[X0: $tType]:((set @ X0 > set @ X0))).
% 0.19/0.30  thf(func_def_121, type, sK57: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_122, type, sK58: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_123, type, sK59: !>[X0: $tType, X1: $tType]:(((X1 > $o) > sum_sum @ X1 @ X0 > X1))).
% 0.19/0.30  thf(func_def_124, type, sK60: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_125, type, sK61: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_126, type, sK62: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_127, type, sK63: !>[X0: $tType]:((set @ X0 > (set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_128, type, sK64: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.19/0.30  thf(func_def_129, type, sK65: !>[X0: $tType, X1: $tType]:(((X1 > $o) > sum_sum @ X0 @ X1 > X1))).
% 0.19/0.30  thf(func_def_130, type, sK66: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_131, type, sK67: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0 > X0))).
% 0.19/0.30  thf(func_def_132, type, sK68: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0 > set @ X0))).
% 0.19/0.30  thf(func_def_133, type, sK69: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0 > set @ X0))).
% 0.19/0.30  thf(func_def_134, type, sK70: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0 > set @ X0))).
% 0.19/0.30  thf(func_def_135, type, sK71: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_136, type, sK72: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.19/0.30  thf(func_def_137, type, sK73: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_138, type, sK74: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_139, type, sK75: !>[X0: $tType]:(((set @ X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_140, type, sK76: !>[X0: $tType]:(((set @ X0 > $o) > set @ X0))).
% 0.19/0.30  thf(func_def_141, type, sK77: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_142, type, sK78: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_143, type, sK79: !>[X0: $tType, X1: $tType]:((sum_sum @ X0 @ X1 > X1 > X1))).
% 0.19/0.30  thf(func_def_144, type, sK80: !>[X0: $tType, X1: $tType]:((sum_sum @ X1 @ X0 > X1 > X1))).
% 0.19/0.30  thf(func_def_145, type, sK81: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_146, type, sK82: !>[X0: $tType]:((set @ X0 > X0))).
% 0.19/0.30  thf(func_def_147, type, sK83: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_148, type, sK84: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.19/0.30  thf(func_def_149, type, sK85: !>[X0: $tType]:((X0 > set @ X0 > X0 > set @ X0 > set @ X0))).
% 0.19/0.30  thf(f274,axiom,(
% 0.19/0.30    (member @ n @ (root @ tra) @ nsa)),
% 0.19/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0)).
% 0.19/0.30  thf(f276,conjecture,(
% 0.19/0.30    (member @ n @ (root @ tra) @ nsa)),
% 0.19/0.30    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2)).
% 0.19/0.30  thf(f277,negated_conjecture,(
% 0.19/0.30    ~(member @ n @ (root @ tra) @ nsa)),
% 0.19/0.30    inference(negated_conjecture,[status(cth)],[f276])).
% 0.19/0.30  thf(f657,plain,(
% 0.19/0.30    (member @ n @ (root @ tra) @ nsa)),
% 0.19/0.30    inference(rectify,[],[f274])).
% 0.19/0.30  thf(f658,plain,(
% 0.19/0.30    (((member @ n @ (root @ tra) @ nsa)) = $true)),
% 0.19/0.30    inference(fool_elimination,[],[f657])).
% 0.19/0.30  thf(f661,plain,(
% 0.19/0.30    ~(member @ n @ (root @ tra) @ nsa)),
% 0.19/0.30    inference(rectify,[],[f277])).
% 0.19/0.30  thf(f662,plain,(
% 0.19/0.30    ~ (((member @ n @ (root @ tra) @ nsa)) = $true)),
% 0.19/0.30    inference(fool_elimination,[],[f661])).
% 0.19/0.30  thf(f696,plain,(
% 0.19/0.30    (((member @ n @ (root @ tra) @ nsa)) != $true)),
% 0.19/0.30    inference(flattening,[],[f662])).
% 0.19/0.30  thf(f1352,plain,(
% 0.19/0.30    (((member @ n @ (root @ tra) @ nsa)) = $true)),
% 0.19/0.30    inference(cnf_transformation,[],[f658])).
% 0.19/0.30  thf(f1354,plain,(
% 0.19/0.30    (((member @ n @ (root @ tra) @ nsa)) != $true)),
% 0.19/0.30    inference(cnf_transformation,[],[f696])).
% 0.19/0.30  thf(f1845,plain,(
% 0.19/0.30    $false),
% 0.19/0.30    inference(global_subsumption,[],[f1352,f1354])).
% 0.19/0.30  % SZS output end Proof for theBenchmark
% 0.19/0.30  % (3880447)------------------------------
% 0.19/0.30  % (3880447)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30  % (3880447)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30  % (3880447)CaDiCaL version: 2.1.3
% 0.19/0.30  % (3880447)Termination reason: Refutation
% 0.19/0.30  % (3880447)Time elapsed: 0.025 s
% 0.19/0.30  % (3880447)Peak memory usage: 13 MB
% 0.19/0.30  % (3880447)Instructions burned: 102 (million)
% 0.19/0.30  % (3880440)Success in time 0.08 s
% 0.19/0.30  % Vampire exiting
%------------------------------------------------------------------------------