%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR125^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 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 : Wed Sep 30 07:47:04 AM UTC 2026
% Result : Theorem 0.10s 0.29s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 21 unt; 0 typ; 4 def)
% Number of atoms : 135 ( 21 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 93 ( 19 ~; 6 |; 0 &; 66 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
num: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(func_def_4,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(func_def_5,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_8,type,
vNOT: $o > $o ).
thf(func_def_12,type,
sF1: $o ).
thf(f1,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).
thf(f3,axiom,
! [X0: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002) ).
thf(f4,conjecture,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f5,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ),
inference(rectify,[],[f5]) ).
thf(f7,plain,
( $true
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(rectify,[],[f1]) ).
thf(f9,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
! [X0: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f11,plain,
! [X0: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) )
= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f14,plain,
( $true
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ),
inference(flattening,[],[f7]) ).
thf(f15,plain,
( $true
!= ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f17,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f18,plain,
! [X0: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f21,definition,
( sF0
= ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) ),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
thf(f22,plain,
( ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
= sF0 ),
inference(reorient_equations,[],[f21]) ).
thf(f23,definition,
( sF1
= ( holdsDuring_THFTYPE_IiooI @ sF0 @ $false ) ),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
thf(f24,plain,
( ( holdsDuring_THFTYPE_IiooI @ sF0 @ $false )
= sF1 ),
inference(reorient_equations,[],[f23]) ).
thf(f25,plain,
$true != sF1,
inference(definition_folding,[],[f15,f24,f22]) ).
thf(f27,plain,
( ( $true = sF1 )
| ( ( holdsDuring_THFTYPE_IiooI @ sF0 @ $false )
= $false ) ),
inference(iff_proxy_clausification,[],[f24]) ).
thf(f29,definition,
( spl2_1
<=> ( ( holdsDuring_THFTYPE_IiooI @ sF0 @ $false )
= $false ) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
thf(f31,plain,
( ( ( holdsDuring_THFTYPE_IiooI @ sF0 @ $false )
= $false )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f29]) ).
thf(f33,definition,
( spl2_2
<=> ( $true = sF1 ) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
thf(f36,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f27,f33,f29]) ).
thf(f46,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f25,f33]) ).
thf(f66,plain,
! [X0: $i] :
( ( holdsDuring_THFTYPE_IiooI @ sF0
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X0 ) )
= $true ),
inference(forward_demodulation,[],[f18,f22]) ).
thf(f67,plain,
( ( holdsDuring_THFTYPE_IiooI @ sF0 @ ~ $true )
= $true ),
inference(constrained_superposition,[],[f66,f17]) ).
thf(f71,plain,
( $true
= ( holdsDuring_THFTYPE_IiooI @ sF0 @ $false ) ),
inference(boolean_simplification,[],[f67]) ).
thf(f81,plain,
( ( $true = $false )
| ~ spl2_1 ),
inference(forward_demodulation,[],[f71,f31]) ).
thf(f82,plain,
( $false
| ~ spl2_1 ),
inference(trivial_inequality_removal,[],[f81]) ).
thf(f83,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f82]) ).
cnf(s1,plain,
( spl2_1
| spl2_2 ),
inference(sat_conversion,[],[f36]) ).
cnf(s3,plain,
~ spl2_2,
inference(sat_conversion,[],[f46]) ).
cnf(s7,plain,
~ spl2_1,
inference(sat_conversion,[],[f83]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s3,s7]) ).
thf(f86,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR125^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n001.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 18:00:51 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.29 % (1604761)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.10/0.29 % (1604772)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.10/0.29 % (1604772)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.10/0.29 % (1604772)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=1156459451:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.10/0.29 % (1604772) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1604761-1604772"...
% 0.10/0.29 % (1604772)...printing done.
% 0.10/0.29 % (1604772)Refutation found. Thanks to Tanya!
% 0.10/0.29 % SZS status Theorem for theBenchmark
% 0.10/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.29 % (1604772)------------------------------
% 0.10/0.29 % (1604772)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.29 % (1604772)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.29 % (1604772)CaDiCaL version: 2.1.3
% 0.10/0.29 % (1604772)Termination reason: Refutation
% 0.10/0.29 % (1604772)Time elapsed: 0.003 s
% 0.10/0.29 % (1604772)Peak memory usage: 13 MB
% 0.10/0.29 % (1604772)Instructions burned: 3 (million)
% 0.10/0.29 % (1604761)Success in time 0.041 s
% 0.10/0.29 % Vampire exiting
%------------------------------------------------------------------------------