%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL035-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 : n004.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:28 AM UTC 2026
% Result : Unsatisfiable 0.30s 0.64s
% Output : Refutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 12 unt; 3 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 45 ( 23 ~; 19 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_CAMeredith) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_4) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4))
| is_a_theorem(implies(implies(X4,X0),implies(X2,X0))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))),
inference(resolution,[],[f5,f4]) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))
| is_a_theorem(implies(X3,X2)) ),
inference(resolution,[],[f6,f1]) ).
fof(f22,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f23,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f26,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(falsehood,X2)))),
inference(resolution,[],[f9,f5]) ).
fof(f30,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f23,f2]) ).
fof(f39,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(falsehood,X2))) ),
inference(resolution,[],[f26,f1]) ).
fof(f70,definition,
( spl0_7
<=> ! [X2,X1] : is_a_theorem(implies(X1,implies(falsehood,X2))) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f71,plain,
( ! [X2,X1] : is_a_theorem(implies(X1,implies(falsehood,X2)))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f72,plain,
( spl0_7
| spl0_2 ),
inference(avatar_split_clause,[],[f65,f22,f70]) ).
fof(f73,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(falsehood,X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f71,f1]) ).
fof(f78,definition,
( spl0_8
<=> ! [X1] : is_a_theorem(implies(falsehood,X1)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f79,plain,
( ! [X1] : is_a_theorem(implies(falsehood,X1))
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f80,plain,
( spl0_8
| spl0_2
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f73,f70,f22,f78]) ).
fof(f81,plain,
( $false
| ~ spl0_8 ),
inference(resolution,[],[f79,f3]) ).
fof(f83,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f81]) ).
cnf(s6,plain,
~ spl0_2,
inference(sat_conversion,[],[f39]) ).
cnf(s10,plain,
( spl0_2
| spl0_7 ),
inference(sat_conversion,[],[f72]) ).
cnf(s11,plain,
( spl0_2
| ~ spl0_7
| spl0_8 ),
inference(sat_conversion,[],[f80]) ).
cnf(s12,plain,
~ spl0_8,
inference(sat_conversion,[],[f83]) ).
cnf(s13,plain,
( spl0_2
| ~ spl0_7 ),
inference(rat,[],[s11,s12]) ).
cnf(s14,plain,
~ spl0_7,
inference(rat,[],[s13,s6]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s10,s14,s6]) ).
fof(f84,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL035-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.50 % Computer : n004.cluster.edu
% 0.23/0.50 % Model : x86_64 x86_64
% 0.23/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.50 % Memory : 8046.5625MB
% 0.23/0.50 % OS : Linux 6.8.0-71-generic
% 0.23/0.50 % CPULimit : 300
% 0.23/0.50 % WCLimit : 300
% 0.23/0.50 % DateTime : Sun Sep 27 15:18:07 UTC 2026
% 0.23/0.50 % CPUTime :
% 0.23/0.50 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.23/0.56 Running first-order model finding
% 0.23/0.56 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.30/0.64 % (3649701)Will run a generic schedule for satisfiability detection.
% 0.30/0.64 % (3649706)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1760598674_2999 on theBenchmark for (2999ds/0Mi)
% 0.30/0.64 % TRYING [1]
% 0.30/0.64 % TRYING [2]
% 0.30/0.64 % TRYING [3]
% 0.30/0.64 % TRYING [4]
% 0.30/0.64 % (3649707)% WARNING: option uhcvi not known.
% 0.30/0.64 % (3649711)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2931617208:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.30/0.64 % (3649708)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1835706339:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.30/0.64 % (3649712)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2704759592:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.30/0.64 % (3649707)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1725152278:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.30/0.64 % (3649710)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3848362997:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.30/0.64 % (3649709)dis+10_1_sil=32000:sp=arity:random_seed=1320491933:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.30/0.64 % (3649711) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3649701-3649711"...
% 0.30/0.64 % (3649709) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3649701-3649709"...
% 0.30/0.64 % (3649712) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3649701-3649712"...
% 0.30/0.64 % (3649707) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3649701-3649707"...
% 0.30/0.64 % (3649708) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3649701-3649708"...
% 0.30/0.64 % (3649711)...printing done.
% 0.30/0.64 % (3649709)...printing done.
% 0.30/0.64 % (3649712)...printing done.
% 0.30/0.64 % (3649707)...printing done.
% 0.30/0.64 % (3649708)...printing done.
% 0.30/0.64 % (3649709)Refutation found. Thanks to Tanya!
% 0.30/0.64 % SZS status Unsatisfiable for theBenchmark
% 0.30/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 0.30/0.64 % (3649709)------------------------------
% 0.30/0.64 % (3649709)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.30/0.64 % (3649709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/0.64 % (3649709)CaDiCaL version: 2.1.3
% 0.30/0.64 % (3649709)Termination reason: Refutation
% 0.30/0.64 % (3649709)Time elapsed: 0.004 s
% 0.30/0.64 % (3649709)Peak memory usage: 11 MB
% 0.30/0.64 % (3649709)Instructions burned: 2 (million)
% 0.30/0.64 % (3649701)Success in time 0.061 s
% 0.30/0.64 % Vampire exiting
%------------------------------------------------------------------------------