%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL072-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 : n018.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:34 AM UTC 2026
% Result : Unsatisfiable 0.68s 0.77s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 16 unt; 2 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 99 ( 51 ~; 46 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 6 ( 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 : 80 ( 0 sgn 80 !; 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,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_19) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X0),X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_37) ).
fof(f4,axiom,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X2)),implies(X0,implies(implies(X3,X2),implies(implies(X1,X3),X2))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_60) ).
fof(f5,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_3) ).
fof(f6,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f2,f1]) ).
fof(f7,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f6,f2]) ).
fof(f9,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
inference(resolution,[],[f7,f6]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(not(X0),X2)) ),
inference(resolution,[],[f3,f1]) ).
fof(f25,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(X1,X2))),
inference(resolution,[],[f24,f2]) ).
fof(f31,plain,
! [X2,X0,X1] : is_a_theorem(implies(not(implies(X0,X1)),implies(not(X0),X2))),
inference(resolution,[],[f24,f3]) ).
fof(f40,definition,
( spl0_1
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f41,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f46,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f41,f2]) ).
fof(f59,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f46]) ).
fof(f156,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))),
inference(resolution,[],[f4,f6]) ).
fof(f167,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(X2,implies(implies(X3,X1),implies(implies(X0,X3),X1))))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f156,f1]) ).
fof(f190,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))) ),
inference(resolution,[],[f167,f1]) ).
fof(f194,definition,
( spl0_7
<=> ! [X0,X1,X3] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1))) ) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f195,plain,
( ! [X3,X0,X1] :
( is_a_theorem(implies(implies(X3,X1),implies(implies(X0,X3),X1)))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f196,plain,
( spl0_1
| spl0_7 ),
inference(avatar_split_clause,[],[f190,f194,f40]) ).
fof(f199,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X2),X1))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(not(X0),X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f195,f1]) ).
fof(f429,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X2),X1))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(X1) )
| ~ spl0_7 ),
inference(resolution,[],[f199,f1]) ).
fof(f431,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X3,X1),X0))
| ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_7 ),
inference(resolution,[],[f429,f25]) ).
fof(f460,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_7 ),
inference(resolution,[],[f431,f2]) ).
fof(f479,plain,
( ! [X0] : is_a_theorem(implies(X0,X0))
| ~ spl0_7 ),
inference(resolution,[],[f460,f2]) ).
fof(f501,plain,
( ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1)))
| ~ spl0_7 ),
inference(resolution,[],[f479,f24]) ).
fof(f505,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(implies(X1,X2)) )
| ~ spl0_7 ),
inference(resolution,[],[f501,f429]) ).
fof(f553,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f505,f9]) ).
fof(f565,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f505,f479]) ).
fof(f613,plain,
( ! [X0] :
( is_a_theorem(implies(implies(X0,X0),X0))
| ~ is_a_theorem(implies(not(X0),X0)) )
| ~ spl0_7 ),
inference(resolution,[],[f565,f195]) ).
fof(f668,plain,
( ! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| ~ is_a_theorem(implies(X0,X0))
| is_a_theorem(X0) )
| ~ spl0_7 ),
inference(resolution,[],[f613,f1]) ).
fof(f671,plain,
( ! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(X0) )
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f668,f479]) ).
fof(f679,plain,
( ! [X0,X1] :
( ~ is_a_theorem(implies(not(implies(X0,X1)),X1))
| is_a_theorem(implies(X0,X1)) )
| ~ spl0_7 ),
inference(resolution,[],[f671,f553]) ).
fof(f727,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ spl0_7 ),
inference(resolution,[],[f679,f31]) ).
fof(f747,plain,
( $false
| ~ spl0_7 ),
inference(resolution,[],[f727,f5]) ).
fof(f748,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f747]) ).
cnf(s8,plain,
~ spl0_1,
inference(sat_conversion,[],[f59]) ).
cnf(s17,plain,
( spl0_1
| spl0_7 ),
inference(sat_conversion,[],[f196]) ).
cnf(s49,plain,
~ spl0_7,
inference(sat_conversion,[],[f748]) ).
cnf(s50,plain,
spl0_1,
inference(rat,[],[s17,s49]) ).
cnf(s52,plain,
$false,
inference(rat,[],[s8,s50]) ).
fof(f749,plain,
$false,
inference(avatar_sat_refutation,[],[s52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL072-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.21/0.47 % Computer : n018.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 27 15:22:54 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.53 Running first-order model finding
% 0.26/0.53 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.68/0.77 % (2499937)Will run a generic schedule for satisfiability detection.
% 0.68/0.77 % (2499947)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1760589568:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.68/0.77 % (2499943)% WARNING: option uhcvi not known.
% 0.68/0.77 % (2499948)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3439643831:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.68/0.77 % (2499946)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2765879363:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.68/0.77 % (2499943)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1954827919:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.68/0.77 % (2499944)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=552418371:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.68/0.77 % (2499945)dis+10_1_sil=32000:sp=arity:random_seed=118772444:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.68/0.77 % (2499942)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3681441791_2999 on theBenchmark for (2999ds/0Mi)
% 0.68/0.77 % TRYING [1]
% 0.68/0.77 % TRYING [2]
% 0.68/0.77 % TRYING [3]
% 0.68/0.77 % TRYING [4]
% 0.68/0.77 % (2499947)Instruction limit reached!
% 0.68/0.77 % (2499947)------------------------------
% 0.68/0.77 % (2499947)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.68/0.77 % (2499947)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.68/0.77 % (2499947)CaDiCaL version: 2.1.3
% 0.68/0.77 % (2499947)Termination reason: Instruction limit
% 0.68/0.77 % (2499947)Termination phase: Saturation
% 0.68/0.77 % (2499947)Time elapsed: 0.071 s
% 0.68/0.77 % (2499947)Peak memory usage: 13 MB
% 0.68/0.77 % (2499947)Instructions burned: 132 (million)
% 0.68/0.77 % (2499945)Instruction limit reached!
% 0.68/0.77 % (2499945)------------------------------
% 0.68/0.77 % (2499945)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.68/0.77 % (2499945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.68/0.77 % (2499945)CaDiCaL version: 2.1.3
% 0.68/0.77 % (2499945)Termination reason: Instruction limit
% 0.68/0.77 % (2499945)Termination phase: Saturation
% 0.68/0.77 % (2499945)Time elapsed: 0.105 s
% 0.68/0.77 % (2499945)Peak memory usage: 11 MB
% 0.68/0.77 % (2499945)Instructions burned: 103 (million)
% 0.68/0.77 % (2499946)Instruction limit reached!
% 0.68/0.77 % (2499946)------------------------------
% 0.68/0.77 % (2499946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.68/0.77 % (2499946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.68/0.77 % (2499946)CaDiCaL version: 2.1.3
% 0.68/0.77 % (2499946)Termination reason: Instruction limit
% 0.68/0.77 % (2499946)Termination phase: Saturation
% 0.68/0.77 % (2499946)Time elapsed: 0.109 s
% 0.68/0.77 % (2499946)Peak memory usage: 11 MB
% 0.68/0.77 % (2499946)Instructions burned: 116 (million)
% 0.68/0.77 % (2499956)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=575191835:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 0.68/0.77 % TRYING [1]
% 0.68/0.77 % TRYING [2]
% 0.68/0.77 % TRYING [3]
% 0.68/0.77 % TRYING [4]
% 0.68/0.77 % (2499948)Instruction limit reached!
% 0.68/0.77 % (2499948)------------------------------
% 0.68/0.77 % (2499948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.68/0.77 % (2499948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.68/0.77 % (2499948)CaDiCaL version: 2.1.3
% 0.68/0.77 % (2499948)Termination reason: Instruction limit
% 0.68/0.77 % (2499948)Termination phase: Saturation
% 0.68/0.77 % (2499948)Time elapsed: 0.131 s
% 0.68/0.77 % (2499948)Peak memory usage: 12 MB
% 0.68/0.77 % (2499948)Instructions burned: 160 (million)
% 0.68/0.77 % (2499957)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=768948150:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.68/0.77 % (2499959)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=354170134:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.68/0.77 % TRYING [5]
% 0.68/0.77 % (2499959) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2499937-2499959"...
% 0.68/0.77 % (2499959)...printing done.
% 0.68/0.77 % (2499959)Refutation found. Thanks to Tanya!
% 0.68/0.77 % SZS status Unsatisfiable for theBenchmark
% 0.68/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.68/0.77 % (2499959)------------------------------
% 0.68/0.77 % (2499959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.68/0.77 % (2499959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.68/0.77 % (2499959)CaDiCaL version: 2.1.3
% 0.68/0.77 % (2499959)Termination reason: Refutation
% 0.68/0.77 % (2499959)Time elapsed: 0.024 s
% 0.68/0.77 % (2499959)Peak memory usage: 12 MB
% 0.68/0.77 % (2499959)Instructions burned: 22 (million)
% 0.68/0.77 % (2499937)Success in time 0.224 s
% 0.68/0.77 % Vampire exiting
%------------------------------------------------------------------------------