%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL131-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 : n026.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:44 AM UTC 2026
% Result : Unsatisfiable 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 10 unt; 1 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 85 ( 46 ~; 38 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 84 !; 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(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_6) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
fof(f4,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))))
| is_a_theorem(X0) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X5,X4)),equivalent(X3,X5)))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(X0,X2))),
inference(resolution,[],[f5,f4]) ).
fof(f9,definition,
( spl0_1
<=> ! [X4,X5,X3] : is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(X5,X4)),equivalent(X3,X5))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f10,plain,
( ! [X3,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X3,X4),equivalent(X5,X4)),equivalent(X3,X5)))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f9]) ).
fof(f15,plain,
spl0_1,
inference(avatar_split_clause,[],[f6,f9]) ).
fof(f16,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X3),equivalent(equivalent(X0,X2),X3)))
| ~ spl0_1 ),
inference(resolution,[],[f10,f4]) ).
fof(f17,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| is_a_theorem(equivalent(X0,X2)) )
| ~ spl0_1 ),
inference(resolution,[],[f10,f1]) ).
fof(f19,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),equivalent(equivalent(X0,X3),equivalent(X2,X3))))
| ~ spl0_1 ),
inference(resolution,[],[f17,f5]) ).
fof(f22,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X1)),X3))
| is_a_theorem(equivalent(equivalent(X0,X2),X3)) )
| ~ spl0_1 ),
inference(resolution,[],[f16,f1]) ).
fof(f23,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1)))
| ~ spl0_1 ),
inference(resolution,[],[f19,f17]) ).
fof(f24,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| is_a_theorem(equivalent(equivalent(X0,X3),equivalent(X2,X3))) )
| ~ spl0_1 ),
inference(resolution,[],[f19,f1]) ).
fof(f27,plain,
( ! [X0] : is_a_theorem(equivalent(X0,X0))
| ~ spl0_1 ),
inference(resolution,[],[f23,f17]) ).
fof(f33,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X2))),equivalent(X0,equivalent(X1,X3))))
| ~ spl0_1 ),
inference(resolution,[],[f22,f2]) ).
fof(f35,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2))))
| ~ spl0_1 ),
inference(resolution,[],[f22,f23]) ).
fof(f51,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X3),equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X2,X1)) )
| ~ spl0_1 ),
inference(resolution,[],[f24,f1]) ).
fof(f53,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) )
| ~ spl0_1 ),
inference(resolution,[],[f35,f1]) ).
fof(f65,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X1,X2)) )
| ~ spl0_1 ),
inference(resolution,[],[f53,f1]) ).
fof(f66,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3))))
| ~ spl0_1 ),
inference(resolution,[],[f33,f22]) ).
fof(f150,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| is_a_theorem(equivalent(X2,X0)) )
| ~ spl0_1 ),
inference(resolution,[],[f51,f27]) ).
fof(f153,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(a,X1)))
| ~ is_a_theorem(equivalent(X0,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))) )
| ~ spl0_1 ),
inference(resolution,[],[f51,f3]) ).
fof(f166,plain,
( ! [X2,X3,X0] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(X2,X2)),X3))
| ~ is_a_theorem(equivalent(X0,X3)) )
| ~ spl0_1 ),
inference(resolution,[],[f66,f51]) ).
fof(f204,plain,
( ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),X0),equivalent(a,X0)))
| ~ spl0_1 ),
inference(resolution,[],[f153,f27]) ).
fof(f223,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),X0)))
| ~ is_a_theorem(equivalent(X1,equivalent(a,X0))) )
| ~ spl0_1 ),
inference(resolution,[],[f204,f65]) ).
fof(f298,plain,
( ! [X0] : ~ is_a_theorem(equivalent(equivalent(a,equivalent(X0,equivalent(equivalent(b,e),equivalent(c,e)))),equivalent(a,equivalent(X0,equivalent(b,c)))))
| ~ spl0_1 ),
inference(resolution,[],[f223,f66]) ).
fof(f329,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)))))
| ~ spl0_1 ),
inference(resolution,[],[f150,f2]) ).
fof(f351,plain,
( ~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c)))))
| ~ spl0_1 ),
inference(resolution,[],[f166,f298]) ).
fof(f363,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[],[f351,f329]) ).
fof(f364,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f363]) ).
cnf(s2,plain,
spl0_1,
inference(sat_conversion,[],[f15]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f364]) ).
cnf(s4,plain,
$false,
inference(rat,[],[s2,s3]) ).
fof(f365,plain,
$false,
inference(avatar_sat_refutation,[],[s4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL131-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 : n026.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:25:57 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 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.19/0.52 % (2990063)Will run a generic schedule for satisfiability detection.
% 0.19/0.52 % (2990070)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4248824993:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.52 % (2990069)% WARNING: option uhcvi not known.
% 0.19/0.52 % (2990068)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=120231784_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.52 % (2990069)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=739703227:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.52 % (2990072)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3703163193:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.52 % (2990071)dis+10_1_sil=32000:sp=arity:random_seed=825530571:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.52 % (2990074)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1361909584:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.52 % (2990073)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1366245551:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.52 % TRYING [1]
% 0.19/0.52 % TRYING [2]
% 0.19/0.52 % TRYING [3]
% 0.19/0.52 % (2990072) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2990063-2990072"...
% 0.19/0.52 % (2990072)...printing done.
% 0.19/0.52 % (2990072)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (2990072)------------------------------
% 0.19/0.52 % (2990072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.52 % (2990072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.52 % (2990072)CaDiCaL version: 2.1.3
% 0.19/0.52 % (2990072)Termination reason: Refutation
% 0.19/0.52 % (2990072)Time elapsed: 0.023 s
% 0.19/0.52 % (2990072)Peak memory usage: 12 MB
% 0.19/0.52 % (2990072)Instructions burned: 20 (million)
% 0.19/0.52 % (2990063)Success in time 0.073 s
% 0.19/0.52 % Vampire exiting
%------------------------------------------------------------------------------