%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL034-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 : 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.46s 0.53s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 66 ( 19 unt; 5 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 153 ( 87 ~; 61 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 147 ( 0 sgn 147 !; 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,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/sandbox/benchmark/theBenchmark.p',c0_CAMeredith) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_3) ).
fof(f4,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(consistent_polarity_flipping,[],[f1]) ).
fof(f5,plain,
! [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)))),
inference(consistent_polarity_flipping,[],[f2]) ).
fof(f6,plain,
is_a_theorem(implies(implies(implies(a,b),a),a)),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f7,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,[],[f5,f4]) ).
fof(f8,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,[],[f7,f5]) ).
fof(f9,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))),
inference(resolution,[],[f8,f7]) ).
fof(f10,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,[],[f8,f4]) ).
fof(f11,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(falsehood,X2))),
inference(resolution,[],[f9,f7]) ).
fof(f13,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(falsehood,X0),X1),implies(X2,X1))),
inference(resolution,[],[f11,f7]) ).
fof(f44,definition,
( spl0_4
<=> ! [X0] : is_a_theorem(X0) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f45,plain,
( ! [X0] : is_a_theorem(X0)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f56,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f45,f5]) ).
fof(f69,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f90,plain,
! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f10,f13]) ).
fof(f97,plain,
! [X2,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(resolution,[],[f90,f4]) ).
fof(f99,definition,
( spl0_6
<=> ! [X2,X1] : ~ is_a_theorem(implies(X1,implies(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f100,plain,
( ! [X2,X1] : ~ is_a_theorem(implies(X1,implies(X2,X1)))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f99]) ).
fof(f101,plain,
( spl0_6
| spl0_4 ),
inference(avatar_split_clause,[],[f97,f44,f99]) ).
fof(f143,plain,
! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X0)),X2),implies(X3,X2))),
inference(resolution,[],[f7,f90]) ).
fof(f146,plain,
( ! [X2,X3,X0,X1,X4] : ~ is_a_theorem(implies(implies(implies(X0,implies(implies(implies(X1,X2),implies(X3,falsehood)),X4)),X1),implies(X3,X1)))
| ~ spl0_6 ),
inference(resolution,[],[f7,f100]) ).
fof(f184,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X1,X0)),X2))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(resolution,[],[f143,f4]) ).
fof(f720,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(implies(X1,X3),implies(X0,falsehood)),X2)))
| ~ spl0_6 ),
inference(resolution,[],[f146,f7]) ).
fof(f1059,plain,
( ! [X2,X3,X0,X1,X4] : ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X4,implies(X3,X1)))))
| ~ spl0_6 ),
inference(resolution,[],[f720,f184]) ).
fof(f1138,plain,
( ! [X2,X3,X0,X1,X4] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X4,implies(X3,X1)))) )
| ~ spl0_6 ),
inference(resolution,[],[f1059,f4]) ).
fof(f1140,definition,
( spl0_23
<=> ! [X4,X3,X2,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X4,implies(X3,X1)))) ),
introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).
fof(f1141,plain,
( ! [X2,X3,X1,X4] : ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X4,implies(X3,X1))))
| ~ spl0_23 ),
inference(avatar_component_clause,[],[f1140]) ).
fof(f1142,plain,
( spl0_23
| spl0_4
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f1138,f99,f44,f1140]) ).
fof(f1159,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,falsehood)))
| ~ is_a_theorem(implies(X3,implies(X2,X0))) )
| ~ spl0_23 ),
inference(resolution,[],[f1141,f4]) ).
fof(f1208,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1))))
| ~ spl0_6
| ~ spl0_23 ),
inference(resolution,[],[f1159,f720]) ).
fof(f1275,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1))) )
| ~ spl0_6
| ~ spl0_23 ),
inference(resolution,[],[f1208,f4]) ).
fof(f1277,definition,
( spl0_25
<=> ! [X2,X1,X3] : ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_25])],[avatar_definition]) ).
fof(f1278,plain,
( ! [X2,X3,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1)))
| ~ spl0_25 ),
inference(avatar_component_clause,[],[f1277]) ).
fof(f1279,plain,
( spl0_25
| spl0_4
| ~ spl0_6
| ~ spl0_23 ),
inference(avatar_split_clause,[],[f1275,f1140,f99,f44,f1277]) ).
fof(f1299,plain,
( ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),X1),implies(X3,X1)))
| ~ spl0_25 ),
inference(resolution,[],[f1278,f7]) ).
fof(f1303,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,falsehood)))
| ~ is_a_theorem(implies(X2,X0)) )
| ~ spl0_25 ),
inference(resolution,[],[f1278,f4]) ).
fof(f1312,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2)))
| ~ spl0_25 ),
inference(resolution,[],[f1299,f7]) ).
fof(f1332,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(implies(X0,falsehood),X1),X2),implies(X0,X2)))
| ~ spl0_25 ),
inference(resolution,[],[f1312,f7]) ).
fof(f1809,plain,
( ! [X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(X0,falsehood),X1)))
| ~ spl0_25 ),
inference(resolution,[],[f1332,f1303]) ).
fof(f1824,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(X0,X1),X0),implies(X2,X0)))
| ~ spl0_25 ),
inference(resolution,[],[f1332,f7]) ).
fof(f1830,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(implies(implies(X0,falsehood),X1),X2))
| ~ is_a_theorem(implies(X0,X2)) )
| ~ spl0_25 ),
inference(resolution,[],[f1332,f4]) ).
fof(f2533,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(implies(implies(X0,falsehood),X1),falsehood),X2)))
| ~ spl0_25 ),
inference(resolution,[],[f1830,f1809]) ).
fof(f2653,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(implies(implies(X0,X1),falsehood),X2),falsehood),X0))
| ~ spl0_25 ),
inference(resolution,[],[f2533,f1303]) ).
fof(f2747,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X2,implies(X0,X1))))
| ~ spl0_25 ),
inference(resolution,[],[f2653,f7]) ).
fof(f2942,plain,
( ! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X0,X1)))
| ~ is_a_theorem(implies(X2,implies(X0,X1))) )
| ~ spl0_25 ),
inference(resolution,[],[f2747,f4]) ).
fof(f3336,plain,
( ! [X2,X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),X1),X1)))
| ~ spl0_25 ),
inference(resolution,[],[f2942,f1824]) ).
fof(f3453,plain,
( ! [X2,X0,X1] :
( is_a_theorem(X0)
| ~ is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) )
| ~ spl0_25 ),
inference(resolution,[],[f3336,f4]) ).
fof(f3455,definition,
( spl0_57
<=> ! [X2,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
introduced(definition,[new_symbols(definition,[spl0_57])],[avatar_definition]) ).
fof(f3456,plain,
( ! [X2,X1] : ~ is_a_theorem(implies(implies(implies(X1,X2),X1),X1))
| ~ spl0_57 ),
inference(avatar_component_clause,[],[f3455]) ).
fof(f3457,plain,
( spl0_57
| spl0_4
| ~ spl0_25 ),
inference(avatar_split_clause,[],[f3453,f1277,f44,f3455]) ).
fof(f3493,plain,
( $false
| ~ spl0_57 ),
inference(resolution,[],[f3456,f6]) ).
fof(f3503,plain,
~ spl0_57,
inference(avatar_contradiction_clause,[],[f3493]) ).
cnf(s10,plain,
~ spl0_4,
inference(sat_conversion,[],[f69]) ).
cnf(s11,plain,
( spl0_4
| spl0_6 ),
inference(sat_conversion,[],[f101]) ).
cnf(s53,plain,
( spl0_4
| ~ spl0_6
| spl0_23 ),
inference(sat_conversion,[],[f1142]) ).
cnf(s56,plain,
( spl0_4
| ~ spl0_6
| ~ spl0_23
| spl0_25 ),
inference(sat_conversion,[],[f1279]) ).
cnf(s128,plain,
( spl0_4
| ~ spl0_25
| spl0_57 ),
inference(sat_conversion,[],[f3457]) ).
cnf(s137,plain,
~ spl0_57,
inference(sat_conversion,[],[f3503]) ).
cnf(s139,plain,
( spl0_4
| ~ spl0_25 ),
inference(rat,[],[s128,s137]) ).
cnf(s140,plain,
~ spl0_25,
inference(rat,[],[s139,s10]) ).
cnf(s141,plain,
spl0_6,
inference(rat,[],[s11,s10]) ).
cnf(s146,plain,
~ spl0_23,
inference(rat,[],[s56,s140,s10,s141]) ).
cnf(s148,plain,
$false,
inference(rat,[],[s53,s10,s146,s141]) ).
fof(f3504,plain,
$false,
inference(avatar_sat_refutation,[],[s148]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL034-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.12/0.37 % Computer : n020.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 15:19:04 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.46/0.53 % (3519617)Will run a generic schedule for satisfiability detection.
% 0.46/0.53 % (3519625)% WARNING: option uhcvi not known.
% 0.46/0.53 % (3519625)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=468120998:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.46/0.53 % (3519623)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3452880163_2999 on theBenchmark for (2999ds/0Mi)
% 0.46/0.53 % (3519629)dis+10_1_sil=32000:sp=arity:random_seed=3462097502:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.46/0.53 % TRYING [1]
% 0.46/0.53 % TRYING [2]
% 0.46/0.53 % TRYING [3]
% 0.46/0.53 % (3519631)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1522751692:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.46/0.53 % (3519633)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3158427194:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.46/0.53 % TRYING [4]
% 0.46/0.53 % (3519635)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=309419370:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.46/0.53 % (3519627)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4025589384:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.46/0.53 % (3519629)Instruction limit reached!
% 0.46/0.53 % (3519629)------------------------------
% 0.46/0.53 % (3519629)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.46/0.53 % (3519629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.46/0.53 % (3519629)CaDiCaL version: 2.1.3
% 0.46/0.53 % (3519629)Termination reason: Instruction limit
% 0.46/0.53 % (3519629)Termination phase: Saturation
% 0.46/0.53 % (3519629)Time elapsed: 0.069 s
% 0.46/0.53 % (3519629)Peak memory usage: 12 MB
% 0.46/0.53 % (3519629)Instructions burned: 103 (million)
% 0.46/0.53 % (3519635) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3519617-3519635"...
% 0.46/0.53 % (3519635)...printing done.
% 0.46/0.53 % (3519635)Refutation found. Thanks to Tanya!
% 0.46/0.53 % SZS status Unsatisfiable for theBenchmark
% 0.46/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.46/0.53 % (3519635)------------------------------
% 0.46/0.53 % (3519635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.46/0.53 % (3519635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.46/0.53 % (3519635)CaDiCaL version: 2.1.3
% 0.46/0.53 % (3519635)Termination reason: Refutation
% 0.46/0.53 % (3519635)Time elapsed: 0.057 s
% 0.46/0.53 % (3519635)Peak memory usage: 13 MB
% 0.46/0.53 % (3519635)Instructions burned: 92 (million)
% 0.46/0.53 % (3519617)Success in time 0.109 s
% 0.46/0.53 % Vampire exiting
%------------------------------------------------------------------------------