%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL081-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 : n005.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:35 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 12 unt; 3 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 26 ~; 22 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 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/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_1) ).
fof(f4,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(X2,X0),implies(X3,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,X4,X5] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))),implies(X5,implies(implies(X3,X1),implies(X4,X1))))),
inference(resolution,[],[f5,f4]) ).
fof(f16,definition,
( spl0_2
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f17,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X3,X1),implies(X4,X1))))
| is_a_theorem(implies(X5,implies(implies(X3,X1),implies(X4,X1)))) ),
inference(resolution,[],[f6,f1]) ).
fof(f22,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f17,f2]) ).
fof(f29,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f22]) ).
fof(f44,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),implies(X3,X1)))),
inference(resolution,[],[f21,f2]) ).
fof(f59,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
inference(resolution,[],[f44,f1]) ).
fof(f64,definition,
( spl0_5
<=> ! [X2,X1,X3] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f65,plain,
( ! [X2,X3,X1] : is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1)))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f66,plain,
( spl0_5
| spl0_2 ),
inference(avatar_split_clause,[],[f59,f16,f64]) ).
fof(f92,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X0))
| is_a_theorem(implies(X2,X0)) )
| ~ spl0_5 ),
inference(resolution,[],[f65,f1]) ).
fof(f145,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1)))
| ~ spl0_5 ),
inference(resolution,[],[f92,f65]) ).
fof(f166,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X1)) )
| ~ spl0_5 ),
inference(resolution,[],[f145,f1]) ).
fof(f173,definition,
( spl0_7
<=> ! [X1] : is_a_theorem(implies(X1,X1)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f174,plain,
( ! [X1] : is_a_theorem(implies(X1,X1))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f173]) ).
fof(f175,plain,
( spl0_7
| spl0_2
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f166,f64,f16,f173]) ).
fof(f176,plain,
( $false
| ~ spl0_7 ),
inference(resolution,[],[f174,f3]) ).
fof(f181,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f176]) ).
cnf(s5,plain,
~ spl0_2,
inference(sat_conversion,[],[f29]) ).
cnf(s8,plain,
( spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f66]) ).
cnf(s11,plain,
( spl0_2
| ~ spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f175]) ).
cnf(s12,plain,
~ spl0_7,
inference(sat_conversion,[],[f181]) ).
cnf(s13,plain,
( spl0_2
| ~ spl0_5 ),
inference(rat,[],[s11,s12]) ).
cnf(s14,plain,
~ spl0_5,
inference(rat,[],[s13,s5]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s8,s14,s5]) ).
fof(f182,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL081-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 : n005.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:02 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 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.11/0.46 % (4125327)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (4125335)dis+10_1_sil=32000:sp=arity:random_seed=3007500653:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (4125335) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4125327-4125335"...
% 0.11/0.46 % (4125333)% WARNING: option uhcvi not known.
% 0.11/0.46 % (4125335)...printing done.
% 0.11/0.46 % (4125333)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2258167793:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46 % (4125332)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=348917056_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46 % (4125334)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2091159250:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46 % (4125335)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (4125335)------------------------------
% 0.11/0.46 % (4125335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (4125335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (4125335)CaDiCaL version: 2.1.3
% 0.11/0.46 % (4125335)Termination reason: Refutation
% 0.11/0.46 % (4125335)Time elapsed: 0.003 s
% 0.11/0.46 % (4125335)Peak memory usage: 11 MB
% 0.11/0.46 % (4125335)Instructions burned: 5 (million)
% 0.11/0.46 % (4125327)Success in time 0.034 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------