%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO141^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 08:49:02 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 8 unt; 0 typ; 2 def)
% Number of atoms : 142 ( 28 equ; 0 cnn)
% Maximal formula atoms : 8 ( 5 avg)
% Number of connectives : 98 ( 18 ~; 10 |; 9 &; 43 @)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_1,type,
cQ: $i > $o ).
thf(func_def_3,type,
cR: $i > $o ).
thf(func_def_4,type,
cP: $i > $o ).
thf(f1,conjecture,
( ( ( cP @ a )
=> ! [X0: $i] : ( cQ @ X0 ) )
=> ( ! [X0: $i] : ( cP @ X0 )
=> ( ( cR @ x )
=> ( cQ @ a ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cADDHYP2) ).
thf(f2,negated_conjecture,
~ ( ( ( cP @ a )
=> ! [X0: $i] : ( cQ @ X0 ) )
=> ( ! [X0: $i] : ( cP @ X0 )
=> ( ( cR @ x )
=> ( cQ @ a ) ) ) ),
inference(negated_conjecture,[status(cth)],[f1]) ).
thf(f3,plain,
~ ( ( ( cP @ a )
=> ! [X0: $i] : ( cQ @ X0 ) )
=> ( ! [X1: $i] : ( cP @ X1 )
=> ( ( cR @ x )
=> ( cQ @ a ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f4,plain,
~ ( ( ( ( cP @ a )
= $true )
=> ! [X0: $i] :
( ( cQ @ X0 )
= $true ) )
=> ( ! [X1: $i] :
( ( cP @ X1 )
= $true )
=> ( ( ( cR @ x )
= $true )
=> ( ( cQ @ a )
= $true ) ) ) ),
inference(fool_elimination,[],[f3]) ).
thf(f5,plain,
( ( ( cQ @ a )
!= $true )
& ( ( cR @ x )
= $true )
& ! [X1: $i] :
( ( cP @ X1 )
= $true )
& ( ! [X0: $i] :
( ( cQ @ X0 )
= $true )
| ( ( cP @ a )
!= $true ) ) ),
inference(ennf_transformation,[],[f4]) ).
thf(f6,plain,
( ( ( cQ @ a )
!= $true )
& ( ( cR @ x )
= $true )
& ! [X1: $i] :
( ( cP @ X1 )
= $true )
& ( ! [X0: $i] :
( ( cQ @ X0 )
= $true )
| ( ( cP @ a )
!= $true ) ) ),
inference(flattening,[],[f5]) ).
thf(f7,plain,
( ( ( cQ @ a )
!= $true )
& ( ( cR @ x )
= $true )
& ! [X0: $i] :
( ( cP @ X0 )
= $true )
& ( ! [X1: $i] :
( $true
= ( cQ @ X1 ) )
| ( ( cP @ a )
!= $true ) ) ),
inference(rectify,[],[f6]) ).
thf(f8,plain,
! [X1: $i] :
( ( $true
= ( cQ @ X1 ) )
| ( ( cP @ a )
!= $true ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f9,plain,
! [X0: $i] :
( ( cP @ X0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f11,plain,
( ( cQ @ a )
!= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,definition,
( spl0_1
<=> ( ( cP @ a )
= $true ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
thf(f17,plain,
( ( ( cP @ a )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f15]) ).
thf(f19,definition,
( spl0_2
<=> ! [X1: $i] :
( $true
= ( cQ @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
thf(f20,plain,
( ! [X1: $i] :
( $true
= ( cQ @ X1 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f21,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f8,f19,f15]) ).
thf(f22,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f17,f9]) ).
thf(f23,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f22]) ).
thf(f24,plain,
( $false
| ~ spl0_2 ),
inference(backward_subsumption_resolution,[],[f11,f20]) ).
thf(f25,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f24]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f21]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f23]) ).
cnf(s3,plain,
~ spl0_2,
inference(sat_conversion,[],[f25]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s1,s3,s2]) ).
thf(f26,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO141^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n001.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 16:40:51 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.26 % (1466876)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (1466882)% WARNING: option uhcvi not known.
% 0.08/0.26 % (1466882)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1321098476:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26 % (1466882)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.08/0.26 % (1466882)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.08/0.26 % (1466882) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1466876-1466882"...
% 0.08/0.26 % (1466882)...printing done.
% 0.08/0.26 % (1466882)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Theorem for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26 % (1466882)------------------------------
% 0.08/0.26 % (1466882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26 % (1466882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26 % (1466882)CaDiCaL version: 2.1.3
% 0.08/0.26 % (1466882)Termination reason: Refutation
% 0.08/0.26 % (1466882)Time elapsed: 0.001 s
% 0.08/0.26 % (1466882)Peak memory usage: 13 MB
% 0.08/0.26 % (1466882)Instructions burned: 1 (million)
% 0.08/0.26 % (1466876)Success in time 0.026 s
% 0.08/0.26 % Vampire exiting
%------------------------------------------------------------------------------