%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM683^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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 08:19:18 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 18 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 114 ( 8 ~; 3 |; 0 &; 100 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 19 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
x: nat ).
thf(func_def_1,type,
y: nat ).
thf(func_def_2,type,
z: nat ).
thf(func_def_3,type,
more: nat > nat > $o ).
thf(func_def_4,type,
pl: nat > nat > nat ).
thf(f1,axiom,
more @ ( pl @ z @ x ) @ ( pl @ z @ y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(f2,axiom,
! [X0: nat,X1: nat,X2: nat] :
( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
=> ( more @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz20a) ).
thf(f3,axiom,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz6) ).
thf(f4,conjecture,
more @ x @ y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz20d) ).
thf(f5,negated_conjecture,
~ ( more @ x @ y ),
inference(negated_conjecture,[status(cth)],[f4]) ).
thf(f6,plain,
more @ ( pl @ z @ x ) @ ( pl @ z @ y ),
inference(rectify,[],[f1]) ).
thf(f7,plain,
( ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f8,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
=> ( more @ X0 @ X1 ) ),
inference(rectify,[],[f2]) ).
thf(f9,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
= $true )
=> ( ( more @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f8]) ).
thf(f10,plain,
~ ( more @ x @ y ),
inference(rectify,[],[f5]) ).
thf(f11,plain,
( ( more @ x @ y )
!= $true ),
inference(fool_elimination,[],[f10]) ).
thf(f12,plain,
( ( more @ x @ y )
!= $true ),
inference(flattening,[],[f11]) ).
thf(f13,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
!= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f14,plain,
( ( more @ ( pl @ z @ x ) @ ( pl @ z @ y ) )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f15,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X2 ) )
!= $true )
| ( ( more @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
! [X0: nat,X1: nat] :
( ( pl @ X0 @ X1 )
= ( pl @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f17,plain,
( ( more @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f20,plain,
( $true
= ( more @ ( pl @ x @ z ) @ ( pl @ z @ y ) ) ),
inference(forward_demodulation,[],[f14,f16]) ).
thf(f21,plain,
( $true
= ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ),
inference(forward_demodulation,[],[f20,f16]) ).
thf(f39,plain,
( ( $true != $true )
| ( ( more @ x @ y )
= $true ) ),
inference(constrained_superposition,[],[f15,f21]) ).
thf(f40,plain,
( ( more @ x @ y )
= $true ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f42,plain,
$false,
inference(forward_subsumption_resolution,[],[f40,f17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM683^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n019.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 12:37:35 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/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.09/0.26 % (695023)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (695033)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3822028901:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.26 % (695033) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-695023-695033"...
% 0.09/0.26 % (695029)% WARNING: option uhcvi not known.
% 0.09/0.26 % (695033)...printing done.
% 0.09/0.26 % (695033)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.26 % (695033)------------------------------
% 0.09/0.26 % (695033)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.26 % (695033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.26 % (695033)CaDiCaL version: 2.1.3
% 0.09/0.26 % (695033)Termination reason: Refutation
% 0.09/0.26 % (695033)Time elapsed: 0.002 s
% 0.09/0.26 % (695033)Peak memory usage: 12 MB
% 0.09/0.26 % (695033)Instructions burned: 2 (million)
% 0.09/0.26 % (695023)Success in time 0.031 s
% 0.09/0.26 % Vampire exiting
%------------------------------------------------------------------------------