%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL104-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 : n014.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.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 14 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 19 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 6 ( 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 : 65 ( 65 !; 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] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_4) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
fof(f4,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(f5,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f7,plain,
! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f8,plain,
is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
inference(consistent_polarity_flipping,[],[f4]) ).
fof(f9,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f7,f5]) ).
fof(f10,plain,
! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(resolution,[],[f6,f9]) ).
fof(f11,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f6,f5]) ).
fof(f13,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X2,X1))) ),
inference(resolution,[],[f10,f5]) ).
fof(f15,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3))),equivalent(X0,X3))),
inference(resolution,[],[f13,f7]) ).
fof(f16,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(equivalent(X3,X1),equivalent(X3,X2))))),
inference(resolution,[],[f13,f10]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3))))
| ~ is_a_theorem(equivalent(X0,X3)) ),
inference(resolution,[],[f15,f5]) ).
fof(f31,plain,
! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[],[f27,f16]) ).
fof(f35,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1))),X3),X3)),
inference(resolution,[],[f27,f6]) ).
fof(f39,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| ~ is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[],[f31,f5]) ).
fof(f43,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f39,f11]) ).
fof(f112,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,[],[f43,f35]) ).
fof(f187,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,[],[f112,f43]) ).
fof(f344,plain,
$false,
inference(resolution,[],[f187,f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL104-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.38 % Computer : n014.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:21:46 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.16/0.48 % (931363)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (931374)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2417311622_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48 % TRYING [1]
% 0.16/0.48 % TRYING [2]
% 0.16/0.48 % TRYING [3]
% 0.16/0.48 % (931375)% WARNING: option uhcvi not known.
% 0.16/0.48 % (931377)dis+10_1_sil=32000:sp=arity:random_seed=940186735:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48 % (931375)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2286868166:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48 % (931376)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2183163820:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48 % (931380)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1441313045:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48 % (931378)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3504431619:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48 % (931379)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=954327109:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % TRYING [4]
% 0.16/0.48 % (931380) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-931363-931380"...
% 0.16/0.48 % (931380)...printing done.
% 0.16/0.48 % (931380)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (931380)------------------------------
% 0.16/0.48 % (931380)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.48 % (931380)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.48 % (931380)CaDiCaL version: 2.1.3
% 0.16/0.48 % (931380)Termination reason: Refutation
% 0.16/0.48 % (931380)Time elapsed: 0.014 s
% 0.16/0.48 % (931380)Peak memory usage: 11 MB
% 0.16/0.48 % (931380)Instructions burned: 21 (million)
% 0.16/0.48 % (931363)Success in time 0.051 s
% 0.16/0.48 % Vampire exiting
%------------------------------------------------------------------------------