%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL033-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 : n020.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.35s 0.47s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 15 unt; 2 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 12 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 52 !; 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(a,implies(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_2) ).
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(f7,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))
| is_a_theorem(implies(X4,implies(X1,X3))) ),
inference(resolution,[],[f5,f1]) ).
fof(f8,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(falsehood,X2))),
inference(resolution,[],[f6,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(f10,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(falsehood,X0),X1),implies(X2,X1))),
inference(resolution,[],[f8,f4]) ).
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(f25,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(falsehood,X1),X2),implies(X3,X2)))),
inference(resolution,[],[f9,f2]) ).
fof(f36,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f25,f23]) ).
fof(f37,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f36]) ).
fof(f79,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f10,f7]) ).
fof(f94,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(resolution,[],[f79,f1]) ).
fof(f100,definition,
( spl0_8
<=> ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f101,plain,
( ! [X2,X1] : is_a_theorem(implies(X1,implies(X2,X1)))
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f100]) ).
fof(f102,plain,
( spl0_8
| spl0_2 ),
inference(avatar_split_clause,[],[f94,f22,f100]) ).
fof(f107,plain,
( $false
| ~ spl0_8 ),
inference(resolution,[],[f101,f3]) ).
fof(f113,plain,
~ spl0_8,
inference(avatar_contradiction_clause,[],[f107]) ).
cnf(s5,plain,
~ spl0_2,
inference(sat_conversion,[],[f37]) ).
cnf(s10,plain,
( spl0_2
| spl0_8 ),
inference(sat_conversion,[],[f102]) ).
cnf(s11,plain,
~ spl0_8,
inference(sat_conversion,[],[f113]) ).
cnf(s12,plain,
spl0_2,
inference(rat,[],[s10,s11]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s5,s12]) ).
fof(f114,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL033-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 % Computer : n020.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 15:19:04 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43 Running first-order model finding
% 0.10/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.35/0.47 % (3519612)Will run a generic schedule for satisfiability detection.
% 0.35/0.47 % (3519624)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2674610594_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.47 % TRYING [1]
% 0.35/0.47 % TRYING [2]
% 0.35/0.47 % (3519634)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3608015969:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.47 % TRYING [3]
% 0.35/0.47 % (3519626)% WARNING: option uhcvi not known.
% 0.35/0.47 % (3519636)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2494232500:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.47 % (3519634) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3519612-3519634"...
% 0.35/0.47 % (3519634)...printing done.
% 0.35/0.47 % (3519634)Refutation found. Thanks to Tanya!
% 0.35/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.35/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.48 % (3519634)------------------------------
% 0.35/0.48 % (3519634)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.48 % (3519634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.48 % (3519634)CaDiCaL version: 2.1.3
% 0.35/0.48 % (3519634)Termination reason: Refutation
% 0.35/0.48 % (3519634)Time elapsed: 0.003 s
% 0.35/0.48 % (3519634)Peak memory usage: 12 MB
% 0.35/0.48 % (3519634)Instructions burned: 3 (million)
% 0.35/0.48 % (3519612)Success in time 0.039 s
% 0.35/0.48 % Vampire exiting
%------------------------------------------------------------------------------