%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COL061-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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 : Tue Sep 29 09:38:19 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.31s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
fof(f2,axiom,
! [X0,X1] : apply(apply(t,X0),X1) = apply(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).
fof(f3,negated_conjecture,
! [X0] : apply(apply(apply(X0,f(X0)),g(X0)),h(X0)) != apply(f(X0),apply(h(X0),g(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q1_combinator) ).
fof(f8,plain,
! [X0,X1] : apply(f(apply(apply(b,X0),X1)),apply(h(apply(apply(b,X0),X1)),g(apply(apply(b,X0),X1)))) != apply(apply(apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),g(apply(apply(b,X0),X1))),h(apply(apply(b,X0),X1))),
inference(superposition,[],[f3,f1]) ).
fof(f17,plain,
! [X0,X1] : apply(f(apply(apply(b,apply(t,X1)),X0)),apply(h(apply(apply(b,apply(t,X1)),X0)),g(apply(apply(b,apply(t,X1)),X0)))) != apply(apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),X0))),X1),g(apply(apply(b,apply(t,X1)),X0))),h(apply(apply(b,apply(t,X1)),X0))),
inference(superposition,[],[f8,f2]) ).
fof(f44,plain,
! [X2,X0,X1] : apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),apply(h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))) != apply(apply(apply(apply(X0,apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))),X2),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),
inference(superposition,[],[f17,f1]) ).
fof(f374,plain,
! [X0,X1] : apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),apply(h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))) != apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),
inference(superposition,[],[f44,f1]) ).
fof(f394,plain,
! [X0] : apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),apply(apply(X0,g(apply(apply(b,apply(t,X0)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))))) != apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))))),
inference(superposition,[],[f374,f1]) ).
fof(f402,plain,
apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))) != apply(f(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,t)),apply(apply(b,b),b))))),
inference(superposition,[],[f394,f2]) ).
fof(f404,plain,
$false,
inference(trivial_inequality_removal,[],[f402]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL061-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n014.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 : Mon Sep 28 21:32:12 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.18/0.31 % (2210308)Will run a generic schedule for satisfiability detection.
% 0.18/0.31 % (2210316)dis+10_1_sil=32000:sp=arity:random_seed=1791168435:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.31 % (2210314)% WARNING: option uhcvi not known.
% 0.18/0.31 % (2210313)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2004932550_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.31 % (2210314)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1742824051:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.31 % (2210315)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2932190068:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.31 % (2210317)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3313056420:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.31 % TRYING [1]
% 0.18/0.31 % TRYING [2]
% 0.18/0.31 % TRYING [3]
% 0.18/0.31 % TRYING [4]
% 0.18/0.31 % (2210319)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=50373014:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.31 % (2210318)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3150617912:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.31 % (2210316)Instruction limit reached!
% 0.18/0.31 % (2210316)------------------------------
% 0.18/0.31 % (2210316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31 % (2210316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31 % (2210316)CaDiCaL version: 2.1.3
% 0.18/0.31 % (2210316)Termination reason: Instruction limit
% 0.18/0.31 % (2210316)Termination phase: Saturation
% 0.18/0.31 % (2210316)Time elapsed: 0.031 s
% 0.18/0.31 % (2210316)Peak memory usage: 12 MB
% 0.18/0.31 % (2210316)Instructions burned: 103 (million)
% 0.18/0.31 % (2210332)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2163345467:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.31 % TRYING [1]
% 0.18/0.31 % TRYING [2]
% 0.18/0.31 % TRYING [3]
% 0.18/0.31 % TRYING [4]
% 0.18/0.31 % (2210315) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2210308-2210315"...
% 0.18/0.31 % (2210315)...printing done.
% 0.18/0.31 % (2210315)Refutation found. Thanks to Tanya!
% 0.18/0.31 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.31 % (2210315)------------------------------
% 0.18/0.31 % (2210315)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31 % (2210315)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31 % (2210315)CaDiCaL version: 2.1.3
% 0.18/0.31 % (2210315)Termination reason: Refutation
% 0.18/0.31 % (2210315)Time elapsed: 0.051 s
% 0.18/0.31 % (2210315)Peak memory usage: 12 MB
% 0.18/0.31 % (2210315)Instructions burned: 91 (million)
% 0.18/0.31 % (2210308)Success in time 0.087 s
% 0.18/0.31 % Vampire exiting
%------------------------------------------------------------------------------