%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SYO613-1 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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 02:32:13 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.15s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 4 unt; 0 def)
% Number of atoms : 279 ( 0 equ)
% Maximal formula atoms : 23 ( 10 avg)
% Number of connectives : 529 ( 276 ~; 253 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 20 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 223 ( 223 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : le(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(f4,axiom,
! [X0] : eq(f(X0),a0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f5,axiom,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X0),a0)
| ~ eq(f(X1),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(f6,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X1),a0)
| ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f5,f4]) ).
fof(f7,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X2),a0)
| ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f6,f4]) ).
fof(f8,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X3),a0)
| ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f7,f4]) ).
fof(f9,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X4),a0)
| ~ eq(f(X5),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f8,f4]) ).
fof(f10,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X5),a0)
| ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f9,f4]) ).
fof(f11,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X6),a0)
| ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f10,f4]) ).
fof(f12,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X7),a0)
| ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f11,f4]) ).
fof(f13,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X8),a0)
| ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f12,f4]) ).
fof(f14,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X9),a0)
| ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f13,f4]) ).
fof(f15,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X10),a0)
| ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f14,f4]) ).
fof(f16,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ eq(f(X11),a0)
| ~ le(s(X0),X1)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X10),X11) ),
inference(global_subsumption,[],[f15,f4]) ).
fof(f17,plain,
! [X2,X3,X10,X0,X11,X1,X8,X6,X9,X7,X4,X5] :
( ~ le(s(X10),X11)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X9),X10)
| ~ le(s(X0),X1) ),
inference(global_subsumption,[],[f16,f4]) ).
fof(f22,plain,
! [X2,X3,X10,X0,X1,X8,X6,X9,X7,X4,X5] :
( ~ le(s(X10),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X8),X9)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f1,f17]) ).
fof(f24,plain,
! [X2,X3,X0,X1,X8,X6,X9,X7,X4,X5] :
( ~ le(s(s(X9)),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X7),X8)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f22,f1]) ).
fof(f28,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ le(s(s(s(X8))),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X6),X7)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f24,f1]) ).
fof(f34,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ le(s(s(s(s(X7)))),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X5),X6)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f28,f1]) ).
fof(f40,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ le(s(s(s(s(s(X6))))),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X4),X5)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f34,f1]) ).
fof(f46,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ le(s(s(s(s(s(s(X5)))))),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X3),X4)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f40,f1]) ).
fof(f52,plain,
! [X2,X3,X0,X1,X4] :
( ~ le(s(s(s(s(s(s(s(X4))))))),X0)
| ~ le(s(X1),X2)
| ~ le(s(X2),X3)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f46,f1]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( ~ le(s(s(s(s(s(s(s(s(X3)))))))),X0)
| ~ le(s(X1),X2)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f52,f1]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ le(s(s(s(s(s(s(s(s(s(X2))))))))),X0)
| ~ le(s(X0),X1) ),
inference(resolution,[],[f58,f1]) ).
fof(f70,plain,
! [X0,X1] : ~ le(s(s(s(s(s(s(s(s(s(s(X0)))))))))),X1),
inference(resolution,[],[f64,f1]) ).
fof(f73,plain,
$false,
inference(resolution,[],[f70,f1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYO613-1 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Mon Sep 28 17:55:53 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.12 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.08/0.15 % (3595478)Will run a generic schedule for satisfiability detection.
% 0.08/0.15 % (3595484)% WARNING: option uhcvi not known.
% 0.08/0.15 % (3595485)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1549604535:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.15 % (3595483)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2109220873_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.15 % (3595484)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=560426766:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.15 % (3595486)dis+10_1_sil=32000:sp=arity:random_seed=528902829:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.15 % (3595487)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2279118470:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.15 % (3595488)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=772017348:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.15 % (3595489)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2738053659:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.15 % (3595485) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3595478-3595485"...
% 0.08/0.15 % TRYING [1]
% 0.08/0.15 % TRYING [2]
% 0.08/0.15 % TRYING [3]
% 0.08/0.15 % (3595485)...printing done.
% 0.08/0.15 % (3595485)Refutation found. Thanks to Tanya!
% 0.08/0.15 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.15 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.15 % (3595485)------------------------------
% 0.08/0.15 % (3595485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.15 % (3595485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.15 % (3595485)CaDiCaL version: 2.1.3
% 0.08/0.15 % (3595485)Termination reason: Refutation
% 0.08/0.15 % (3595485)Time elapsed: 0.003 s
% 0.08/0.15 % (3595485)Peak memory usage: 11 MB
% 0.08/0.15 % (3595485)Instructions burned: 9 (million)
% 0.08/0.15 % (3595478)Success in time 0.027 s
% 0.08/0.15 % Vampire exiting
%------------------------------------------------------------------------------