%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL118-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 : n019.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:42 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 10 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 7 ( 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 : 51 ( 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X1,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wo) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yqm) ).
fof(f4,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X2,equivalent(X1,X0))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(X1,equivalent(X0,X2))))),
inference(resolution,[],[f4,f2]) ).
fof(f7,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X0,X2)))) ),
inference(resolution,[],[f5,f1]) ).
fof(f8,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),X0)))),
inference(resolution,[],[f7,f2]) ).
fof(f9,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(equivalent(X3,X2),X0)))),
inference(resolution,[],[f7,f5]) ).
fof(f12,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,equivalent(X2,X1)),X0))) ),
inference(resolution,[],[f8,f1]) ).
fof(f13,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2))),
inference(resolution,[],[f9,f4]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,equivalent(X1,X0)),equivalent(equivalent(X3,X4),equivalent(X5,equivalent(X4,equivalent(X3,X5))))))),
inference(resolution,[],[f12,f5]) ).
fof(f26,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(equivalent(X3,equivalent(X1,equivalent(X0,X3))),X2)) ),
inference(resolution,[],[f13,f1]) ).
fof(f64,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X0))),equivalent(X2,equivalent(X1,X3)))),
inference(resolution,[],[f26,f2]) ).
fof(f113,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X0))))
| is_a_theorem(equivalent(X2,equivalent(X1,X3))) ),
inference(resolution,[],[f64,f1]) ).
fof(f294,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X2,X0)))),
inference(resolution,[],[f113,f20]) ).
fof(f545,plain,
$false,
inference(resolution,[],[f294,f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL118-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n019.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 15:23:03 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 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.20/0.51 % (3197075)Will run a generic schedule for satisfiability detection.
% 0.20/0.51 % (3197084)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1907767520:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.20/0.51 % (3197081)% WARNING: option uhcvi not known.
% 0.20/0.51 % (3197080)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4148797221_3000 on theBenchmark for (3000ds/0Mi)
% 0.20/0.51 % (3197086)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4126706518:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.20/0.51 % (3197083)dis+10_1_sil=32000:sp=arity:random_seed=3588348205:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.20/0.51 % (3197081)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1427875342:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.20/0.51 % (3197082)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3673123852:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.20/0.51 % (3197085)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=644543067:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.20/0.51 % TRYING [1]
% 0.20/0.51 % TRYING [2]
% 0.20/0.51 % TRYING [3]
% 0.20/0.51 % TRYING [4]
% 0.20/0.51 % (3197085) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3197075-3197085"...
% 0.20/0.51 % (3197085)...printing done.
% 0.20/0.51 % (3197085)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (3197085)------------------------------
% 0.20/0.51 % (3197085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.51 % (3197085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.51 % (3197085)CaDiCaL version: 2.1.3
% 0.20/0.51 % (3197085)Termination reason: Refutation
% 0.20/0.51 % (3197085)Time elapsed: 0.024 s
% 0.20/0.51 % (3197085)Peak memory usage: 11 MB
% 0.20/0.51 % (3197085)Instructions burned: 22 (million)
% 0.20/0.51 % (3197075)Success in time 0.063 s
% 0.20/0.51 % Vampire exiting
%------------------------------------------------------------------------------