%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL113-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 : n019.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:41 AM UTC 2026
% Result : Unsatisfiable 0.38s 0.72s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 15 unt; 2 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 52 ( 28 ~; 22 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 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,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).
fof(f5,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),b),implies(not(b),a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_33) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f8,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),not(X1)))
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f5,f1]) ).
fof(f11,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f3,f1]) ).
fof(f13,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X1))
| is_a_theorem(implies(implies(X1,X0),X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f11,f1]) ).
fof(f28,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f13,f7]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
| is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(resolution,[],[f26,f5]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f26,f28]) ).
fof(f85,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f38,f3]) ).
fof(f93,definition,
( spl0_5
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f94,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f93]) ).
fof(f99,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f94,f2]) ).
fof(f113,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f114,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f32,f2]) ).
fof(f163,plain,
! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[],[f114,f32]) ).
fof(f210,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(X0)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f163,f38]) ).
fof(f218,definition,
( spl0_7
<=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f219,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f218]) ).
fof(f220,plain,
( spl0_5
| spl0_7 ),
inference(avatar_split_clause,[],[f210,f218,f93]) ).
fof(f222,plain,
( ! [X0] : is_a_theorem(implies(X0,not(not(X0))))
| ~ spl0_7 ),
inference(resolution,[],[f219,f8]) ).
fof(f278,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(not(X2),X0),implies(X1,X2)))
| ~ is_a_theorem(implies(X0,not(X1))) ),
inference(resolution,[],[f85,f32]) ).
fof(f3202,plain,
~ is_a_theorem(implies(b,not(not(b)))),
inference(resolution,[],[f278,f6]) ).
fof(f3236,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f3202,f222]) ).
fof(f3237,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f3236]) ).
cnf(s7,plain,
~ spl0_5,
inference(sat_conversion,[],[f113]) ).
cnf(s12,plain,
( spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f220]) ).
cnf(s208,plain,
~ spl0_7,
inference(sat_conversion,[],[f3237]) ).
cnf(s212,plain,
spl0_5,
inference(rat,[],[s12,s208]) ).
cnf(s219,plain,
$false,
inference(rat,[],[s7,s212]) ).
fof(f3238,plain,
$false,
inference(avatar_sat_refutation,[],[s219]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL113-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.48 % Computer : n019.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Sun Sep 27 15:22:34 UTC 2026
% 0.22/0.49 % CPUTime :
% 0.22/0.49 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.54 Running first-order model finding
% 0.25/0.54 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.38/0.72 % (3196197)Will run a generic schedule for satisfiability detection.
% 0.38/0.72 % (3196207)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2888363085:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.72 % (3196203)% WARNING: option uhcvi not known.
% 0.38/0.72 % (3196203)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2968714208:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.72 % (3196204)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3085746852:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.72 % (3196202)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2838030622_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.72 % (3196206)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=367247046:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.72 % (3196205)dis+10_1_sil=32000:sp=arity:random_seed=3020455241:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.72 % TRYING [1]
% 0.38/0.72 % TRYING [2]
% 0.38/0.72 % TRYING [3]
% 0.38/0.72 % (3196208)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4017222462:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.72 % TRYING [4]
% 0.38/0.72 % (3196207)Instruction limit reached!
% 0.38/0.72 % (3196207)------------------------------
% 0.38/0.72 % (3196207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.72 % (3196207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.72 % (3196207)CaDiCaL version: 2.1.3
% 0.38/0.72 % (3196207)Termination reason: Instruction limit
% 0.38/0.72 % (3196207)Termination phase: Saturation
% 0.38/0.72 % (3196207)Time elapsed: 0.068 s
% 0.38/0.72 % (3196207)Peak memory usage: 13 MB
% 0.38/0.72 % (3196207)Instructions burned: 132 (million)
% 0.38/0.72 % (3196205) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3196197-3196205"...
% 0.38/0.72 % (3196216)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=60286739:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 0.38/0.72 % (3196205)...printing done.
% 0.38/0.72 % (3196206)Instruction limit reached!
% 0.38/0.72 % (3196206)------------------------------
% 0.38/0.72 % (3196206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.72 % (3196206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.72 % (3196206)CaDiCaL version: 2.1.3
% 0.38/0.72 % (3196206)Termination reason: Instruction limit
% 0.38/0.72 % (3196206)Termination phase: Saturation
% 0.38/0.72 % (3196206)Time elapsed: 0.107 s
% 0.38/0.72 % (3196206)Peak memory usage: 12 MB
% 0.38/0.72 % (3196206)Instructions burned: 116 (million)
% 0.38/0.72 % TRYING [1]
% 0.38/0.72 % TRYING [2]
% 0.38/0.72 % (3196205)Refutation found. Thanks to Tanya!
% 0.38/0.72 % SZS status Unsatisfiable for theBenchmark
% 0.38/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.72 % (3196205)------------------------------
% 0.38/0.72 % (3196205)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.72 % (3196205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.72 % (3196205)CaDiCaL version: 2.1.3
% 0.38/0.72 % (3196205)Termination reason: Refutation
% 0.38/0.72 % (3196205)Time elapsed: 0.104 s
% 0.38/0.72 % (3196205)Peak memory usage: 12 MB
% 0.38/0.72 % (3196205)Instructions burned: 100 (million)
% 0.38/0.72 % (3196197)Success in time 0.164 s
% 0.38/0.72 % Vampire exiting
%------------------------------------------------------------------------------