%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP209^1 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n013.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:11:08 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 12 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 93 ( 5 ~; 0 |; 0 &; 88 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 42 ( 40 usr; 4 con; 0-4 aty)
% Number of variables : 16 ( 0 ^; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
syntax_ac_operator_a: ( a > a > a ) > $o ).
thf(func_def_1,type,
a2: a ).
thf(func_def_2,type,
b: a ).
thf(func_def_3,type,
c: a ).
thf(func_def_4,type,
f: a > a > a ).
thf(func_def_8,type,
vAND: $o > $o > $o ).
thf(func_def_9,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_10,type,
db3:
!>[X0: $tType] : X0 ).
thf(func_def_11,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_13,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_15,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_16,type,
sK0: ( a > a > a ) > a ).
thf(func_def_17,type,
sK1: ( a > a > a ) > a ).
thf(func_def_18,type,
sK2: ( a > a > a ) > a ).
thf(func_def_19,type,
sK3: ( a > a > a ) > a ).
thf(func_def_20,type,
sK4: ( a > a > a ) > a ).
thf(func_def_21,type,
vNOT: $o > $o ).
thf(func_def_22,type,
sK5: ( a > a > a ) > a ).
thf(func_def_23,type,
sK6: ( a > a > a ) > a ).
thf(func_def_24,type,
sK7: ( a > a > a ) > a ).
thf(func_def_25,type,
sK8: ( a > a > a ) > a ).
thf(func_def_26,type,
sK9: ( a > a > a ) > a ).
thf(func_def_27,type,
sK10: ( a > a > a ) > a ).
thf(func_def_28,type,
sK11: ( a > a > a ) > a ).
thf(func_def_29,type,
sK12: ( a > a > a ) > a ).
thf(func_def_30,type,
sK13: ( a > a > a ) > a ).
thf(func_def_31,type,
sK14: ( a > a > a ) > a ).
thf(func_def_32,type,
sK15: ( a > a > a ) > a ).
thf(func_def_33,type,
sK16: ( a > a > a ) > a ).
thf(func_def_34,type,
sK17: ( a > a > a ) > a ).
thf(func_def_35,type,
sK18: ( a > a > a ) > a ).
thf(func_def_36,type,
sK19: ( a > a > a ) > a ).
thf(func_def_37,type,
sK20: ( a > a > a ) > a ).
thf(func_def_38,type,
sK21: ( a > a > a ) > a ).
thf(func_def_39,type,
sK22: ( a > a > a ) > a ).
thf(func_def_40,type,
sK23: ( a > a > a ) > a ).
thf(func_def_41,type,
sK24: ( a > a > a ) > a ).
thf(f2,axiom,
! [X0: a,X1: a] :
( ( f @ X0 @ X1 )
= ( f @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_commute) ).
thf(f3,axiom,
! [X0: a,X1: a,X2: a] :
( ( f @ X0 @ ( f @ X1 @ X2 ) )
= ( f @ X1 @ ( f @ X0 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_left__commute) ).
thf(f4,axiom,
! [X0: a,X1: a,X2: a] :
( ( f @ ( f @ X0 @ X1 ) @ X2 )
= ( f @ X0 @ ( f @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_right__assoc) ).
thf(f11,conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
= ( f @ ( f @ a2 @ c ) @ b ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(f12,negated_conjecture,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(negated_conjecture,[status(cth)],[f11]) ).
thf(f27,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(flattening,[],[f12]) ).
thf(f37,plain,
! [X0: a,X1: a] :
( ( f @ X0 @ X1 )
= ( f @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f2]) ).
thf(f38,plain,
! [X2: a,X0: a,X1: a] :
( ( f @ X0 @ ( f @ X1 @ X2 ) )
= ( f @ X1 @ ( f @ X0 @ X2 ) ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f39,plain,
! [X2: a,X0: a,X1: a] :
( ( f @ X0 @ ( f @ X1 @ X2 ) )
= ( f @ ( f @ X0 @ X1 ) @ X2 ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f46,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ ( f @ a2 @ c ) @ b ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f141,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ b @ ( f @ a2 @ c ) ) ),
inference(constrained_superposition,[],[f46,f37]) ).
thf(f142,plain,
( ( f @ ( f @ a2 @ b ) @ c )
!= ( f @ a2 @ ( f @ b @ c ) ) ),
inference(forward_demodulation,[],[f141,f38]) ).
thf(f144,plain,
$false,
inference(forward_subsumption_resolution,[],[f142,f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP209^1 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18 % Computer : n013.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 20:12:51 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.22 Running first-order model finding
% 0.10/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.10/0.25 % (2603895)Will run a generic schedule for satisfiability detection.
% 0.10/0.25 % (2603904)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2508128846:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25 % (2603904)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.10/0.25 % (2603901)% WARNING: option uhcvi not known.
% 0.10/0.25 % (2603904) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2603895-2603904"...
% 0.10/0.25 % (2603904)...printing done.
% 0.10/0.25 % (2603904)Refutation found. Thanks to Tanya!
% 0.10/0.25 % SZS status Theorem for theBenchmark
% 0.10/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25 % (2603904)------------------------------
% 0.10/0.25 % (2603904)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25 % (2603904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25 % (2603904)CaDiCaL version: 2.1.3
% 0.10/0.25 % (2603904)Termination reason: Refutation
% 0.10/0.25 % (2603904)Time elapsed: 0.003 s
% 0.10/0.25 % (2603904)Peak memory usage: 12 MB
% 0.10/0.25 % (2603904)Instructions burned: 9 (million)
% 0.10/0.25 % (2603895)Success in time 0.021 s
% 0.10/0.25 % Vampire exiting
%------------------------------------------------------------------------------