%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL107-1 : TPTP v9.3.1. Released v1.0.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 : Tue Sep 29 11:57:39 AM UTC 2026
% Result : Unsatisfiable 0.48s 0.62s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 8 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 67 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_27_1690) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p_1) ).
fof(f4,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))))
| is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X0),X6))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(resolution,[],[f5,f4]) ).
fof(f9,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)))
| is_a_theorem(equivalent(equivalent(X1,X2),X7)) ),
inference(resolution,[],[f6,f1]) ).
fof(f10,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(X5,X6),X7))),
inference(resolution,[],[f9,f2]) ).
fof(f22,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)))
| is_a_theorem(equivalent(equivalent(X5,X6),X7)) ),
inference(resolution,[],[f10,f1]) ).
fof(f88,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(resolution,[],[f22,f2]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(resolution,[],[f88,f1]) ).
fof(f569,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[],[f199,f88]) ).
fof(f1014,plain,
$false,
inference(resolution,[],[f569,f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL107-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.44 % Computer : n013.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 27 15:21:21 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.50 Running first-order model finding
% 0.23/0.50 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.48/0.62 % (342792)Will run a generic schedule for satisfiability detection.
% 0.48/0.62 % (342801)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4067636979:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.48/0.62 % (342798)% WARNING: option uhcvi not known.
% 0.48/0.62 % (342798)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3587869566:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.48/0.62 % (342800)dis+10_1_sil=32000:sp=arity:random_seed=1929758564:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.48/0.62 % (342797)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1798884526_2999 on theBenchmark for (2999ds/0Mi)
% 0.48/0.62 % (342799)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4284863356:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.48/0.62 % (342802)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3178960874:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.48/0.62 % (342803)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1829069441:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.48/0.62 % TRYING [1]
% 0.48/0.62 % TRYING [2]
% 0.48/0.62 % TRYING [3]
% 0.48/0.62 % (342801)Instruction limit reached!
% 0.48/0.62 % (342801)------------------------------
% 0.48/0.62 % (342801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.62 % (342801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.62 % (342801)CaDiCaL version: 2.1.3
% 0.48/0.62 % (342801)Termination reason: Instruction limit
% 0.48/0.62 % (342801)Termination phase: Saturation
% 0.48/0.62 % (342801)Time elapsed: 0.060 s
% 0.48/0.62 % (342801)Peak memory usage: 12 MB
% 0.48/0.62 % (342801)Instructions burned: 116 (million)
% 0.48/0.62 % (342802) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-342792-342802"...
% 0.48/0.62 % (342802)...printing done.
% 0.48/0.62 % (342802)Refutation found. Thanks to Tanya!
% 0.48/0.62 % SZS status Unsatisfiable for theBenchmark
% 0.48/0.62 % SZS output start Proof for theBenchmark
% See solution above
% 0.48/0.62 % (342802)------------------------------
% 0.48/0.62 % (342802)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.62 % (342802)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.62 % (342802)CaDiCaL version: 2.1.3
% 0.48/0.62 % (342802)Termination reason: Refutation
% 0.48/0.62 % (342802)Time elapsed: 0.052 s
% 0.48/0.62 % (342802)Peak memory usage: 11 MB
% 0.48/0.62 % (342802)Instructions burned: 53 (million)
% 0.48/0.62 % (342792)Success in time 0.1 s
% 0.48/0.62 % Vampire exiting
%------------------------------------------------------------------------------