%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL008-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 : n016.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.26s 0.59s
% Output : Refutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 25 ( 9 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 29 !; 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(a,b),equivalent(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ec_4) ).
fof(f4,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f5,plain,
! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f6,plain,
is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f7,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f5,f4]) ).
fof(f8,plain,
is_a_theorem(equivalent(b,b)),
inference(resolution,[],[f7,f6]) ).
fof(f9,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f7,f4]) ).
fof(f11,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f9,f4]) ).
fof(f19,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X3,equivalent(X2,X0)))
| is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[],[f11,f7]) ).
fof(f76,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(b,b),equivalent(X2,X0)))
| is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[],[f19,f8]) ).
fof(f201,plain,
! [X0,X1] :
( is_a_theorem(equivalent(equivalent(b,X0),X1))
| is_a_theorem(equivalent(equivalent(X0,b),X1)) ),
inference(resolution,[],[f76,f5]) ).
fof(f343,plain,
! [X0] : is_a_theorem(equivalent(equivalent(b,b),X0)),
inference(factoring,[],[f201]) ).
fof(f344,plain,
$false,
inference(resolution,[],[f343,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.48 % Computer : n016.cluster.edu
% 0.23/0.48 % Model : x86_64 x86_64
% 0.23/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.48 % Memory : 8046.5625MB
% 0.23/0.48 % OS : Linux 6.8.0-71-generic
% 0.23/0.48 % CPULimit : 300
% 0.23/0.48 % WCLimit : 300
% 0.23/0.48 % DateTime : Sun Sep 27 15:21:47 UTC 2026
% 0.23/0.48 % CPUTime :
% 0.23/0.49 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.26/0.52 Running first-order model finding
% 0.26/0.52 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.26/0.59 % (2769907)Will run a generic schedule for satisfiability detection.
% 0.26/0.59 % (2769913)% WARNING: option uhcvi not known.
% 0.26/0.59 % (2769913)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2983626161:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.26/0.59 % (2769913) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2769907-2769913"...
% 0.26/0.59 % (2769913)...printing done.
% 0.26/0.59 % (2769912)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4281561321_2999 on theBenchmark for (2999ds/0Mi)
% 0.26/0.59 % (2769916)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3493829271:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.26/0.59 % (2769913)Refutation found. Thanks to Tanya!
% 0.26/0.59 % SZS status Unsatisfiable for theBenchmark
% 0.26/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.59 % (2769913)------------------------------
% 0.26/0.59 % (2769913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.59 % (2769913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.59 % (2769913)CaDiCaL version: 2.1.3
% 0.26/0.59 % (2769913)Termination reason: Refutation
% 0.26/0.59 % (2769913)Time elapsed: 0.011 s
% 0.26/0.59 % (2769913)Peak memory usage: 11 MB
% 0.26/0.59 % (2769913)Instructions burned: 20 (million)
% 0.26/0.59 % (2769907)Success in time 0.05 s
% 0.26/0.59 % Vampire exiting
%------------------------------------------------------------------------------