%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL009-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 : n002.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:25 AM UTC 2026
% Result : Unsatisfiable 0.42s 0.47s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 49 !; 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,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',yql) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(a,equivalent(b,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ec_5) ).
fof(f4,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X0,X2)) ),
inference(resolution,[],[f4,f1]) ).
fof(f6,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
| is_a_theorem(equivalent(X0,equivalent(X3,X2))) ),
inference(resolution,[],[f5,f2]) ).
fof(f7,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X0,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(resolution,[],[f5,f4]) ).
fof(f8,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[],[f6,f2]) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,X3)))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
inference(resolution,[],[f6,f4]) ).
fof(f10,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),equivalent(X2,X1))),
inference(resolution,[],[f8,f6]) ).
fof(f13,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),X3)))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
inference(resolution,[],[f7,f2]) ).
fof(f20,plain,
~ is_a_theorem(equivalent(equivalent(b,equivalent(b,c)),c)),
inference(resolution,[],[f9,f3]) ).
fof(f24,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X3,X0),X2))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(X3,X1)) ),
inference(resolution,[],[f9,f1]) ).
fof(f25,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X3)))
| is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X2,X0))) ),
inference(resolution,[],[f13,f6]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X0,X3)))
| is_a_theorem(equivalent(equivalent(X1,X3),X2)) ),
inference(resolution,[],[f24,f10]) ).
fof(f70,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X1,X2),X0))),
inference(resolution,[],[f25,f2]) ).
fof(f714,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
inference(resolution,[],[f58,f70]) ).
fof(f793,plain,
$false,
inference(resolution,[],[f714,f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n002.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 15:19:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.42/0.47 % (3656665)Will run a generic schedule for satisfiability detection.
% 0.42/0.47 % (3656675)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4282103165:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.42/0.47 % (3656670)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3688828822_2999 on theBenchmark for (2999ds/0Mi)
% 0.42/0.47 % (3656672)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2142965667:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.42/0.47 % (3656673)dis+10_1_sil=32000:sp=arity:random_seed=1370465341:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.42/0.47 % (3656674)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2739707215:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.42/0.47 % (3656676)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1806929410:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.42/0.47 % TRYING [1]
% 0.42/0.47 % TRYING [2]
% 0.42/0.47 % TRYING [3]
% 0.42/0.47 % (3656671)% WARNING: option uhcvi not known.
% 0.42/0.47 % (3656671)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3345755641:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.42/0.47 % TRYING [4]
% 0.42/0.47 % (3656673) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3656665-3656673"...
% 0.42/0.47 % (3656672) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3656665-3656672"...
% 0.42/0.47 % (3656673)...printing done.
% 0.42/0.47 % (3656672)...printing done.
% 0.42/0.47 % (3656673)Refutation found. Thanks to Tanya!
% 0.42/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.42/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.47 % (3656673)------------------------------
% 0.42/0.47 % (3656673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.47 % (3656673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.47 % (3656673)CaDiCaL version: 2.1.3
% 0.42/0.47 % (3656673)Termination reason: Refutation
% 0.42/0.47 % (3656673)Time elapsed: 0.019 s
% 0.42/0.47 % (3656673)Peak memory usage: 11 MB
% 0.42/0.47 % (3656673)Instructions burned: 29 (million)
% 0.42/0.47 % (3656665)Success in time 0.058 s
% 0.42/0.47 % Vampire exiting
%------------------------------------------------------------------------------