%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL428-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:58:37 AM UTC 2026
% Result : Unsatisfiable 1.32s 0.67s
% Output : Refutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 75 ( 43 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 18 ( 18 usr; 17 con; 0-2 aty)
% Number of variables : 68 ( 68 !; 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',mv1) ).
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',mv2) ).
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',mv3) ).
fof(f5,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),implies(X1,X0)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv5) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_hr) ).
fof(f16,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f2]) ).
fof(f32,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(f33,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X0,X1),X1))
| is_a_theorem(implies(implies(X1,X0),X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(resolution,[],[f32,f1]) ).
fof(f57,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f33,f16]) ).
fof(f84,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f38,f2]) ).
fof(f90,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f38,f57]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(implies(X2,X1)) ),
inference(resolution,[],[f84,f1]) ).
fof(f129,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X3,X0))
| is_a_theorem(implies(X2,implies(X3,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f97,f32]) ).
fof(f222,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(resolution,[],[f90,f3]) ).
fof(f223,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(implies(X0,X1),X1),X0))
| ~ is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f90,f4]) ).
fof(f224,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X1,X2)),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f90,f57]) ).
fof(f295,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X2,X0),X1))
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f222,f90]) ).
fof(f317,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f223,f1]) ).
fof(f404,plain,
( ~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16)),v16))
| ~ is_a_theorem(implies(x,implies(y,x))) ),
inference(resolution,[],[f295,f6]) ).
fof(f411,plain,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16)),v16)),
inference(forward_subsumption_resolution,[],[f404,f2]) ).
fof(f412,plain,
( ~ is_a_theorem(implies(v14,implies(v15,v14)))
| ~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13)) ),
inference(resolution,[],[f411,f224]) ).
fof(f415,plain,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13)),
inference(forward_subsumption_resolution,[],[f412,f2]) ).
fof(f416,plain,
( ~ is_a_theorem(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)))
| ~ is_a_theorem(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10)) ),
inference(resolution,[],[f415,f224]) ).
fof(f419,plain,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10)),
inference(forward_subsumption_resolution,[],[f416,f5]) ).
fof(f420,plain,
( ~ is_a_theorem(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)))
| ~ is_a_theorem(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7)) ),
inference(resolution,[],[f419,f224]) ).
fof(f423,plain,
~ is_a_theorem(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7)),
inference(forward_subsumption_resolution,[],[f420,f4]) ).
fof(f424,plain,
( ~ is_a_theorem(implies(w,implies(v6,w)))
| ~ is_a_theorem(implies(implies(z,u),implies(implies(v,z),implies(v,u)))) ),
inference(resolution,[],[f423,f224]) ).
fof(f427,plain,
~ is_a_theorem(implies(implies(z,u),implies(implies(v,z),implies(v,u)))),
inference(forward_subsumption_resolution,[],[f424,f2]) ).
fof(f3388,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f129,f2]) ).
fof(f3474,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(implies(X1,X2),X2)))),
inference(resolution,[],[f3388,f4]) ).
fof(f3567,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(implies(X0,X1),X1)),X2))
| is_a_theorem(X2) ),
inference(resolution,[],[f3474,f317]) ).
fof(f4106,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X0,X2),X2),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f3567,f222]) ).
fof(f5033,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,implies(X0,X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f4106,f32]) ).
fof(f5352,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(resolution,[],[f5033,f3]) ).
fof(f6038,plain,
$false,
inference(resolution,[],[f5352,f427]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL428-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n002.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 15:44:37 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.44 Running first-order model finding
% 0.13/0.44 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
% 1.32/0.67 % (3698267)Will run a generic schedule for satisfiability detection.
% 1.32/0.67 % (3698272)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=357646192_2999 on theBenchmark for (2999ds/0Mi)
% 1.32/0.67 % TRYING [1]
% 1.32/0.67 % TRYING [2]
% 1.32/0.67 % TRYING [3]
% 1.32/0.67 % (3698273)% WARNING: option uhcvi not known.
% 1.32/0.67 % (3698277)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3292259874:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.32/0.67 % (3698276)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3322787273:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.32/0.67 % (3698275)dis+10_1_sil=32000:sp=arity:random_seed=578142308:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.32/0.67 % (3698273)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=786815054:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.32/0.67 % (3698278)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1011293503:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.32/0.67 % (3698274)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2501652389:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.32/0.67 % (3698275)Instruction limit reached!
% 1.32/0.67 % (3698275)------------------------------
% 1.32/0.67 % (3698275)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (3698275)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (3698275)CaDiCaL version: 2.1.3
% 1.32/0.67 % (3698275)Termination reason: Instruction limit
% 1.32/0.67 % (3698275)Termination phase: Saturation
% 1.32/0.67 % (3698275)Time elapsed: 0.088 s
% 1.32/0.67 % (3698275)Peak memory usage: 11 MB
% 1.32/0.67 % (3698275)Instructions burned: 104 (million)
% 1.32/0.67 % (3698276)Instruction limit reached!
% 1.32/0.67 % (3698276)------------------------------
% 1.32/0.67 % (3698276)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (3698276)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (3698276)CaDiCaL version: 2.1.3
% 1.32/0.67 % (3698276)Termination reason: Instruction limit
% 1.32/0.67 % (3698276)Termination phase: Saturation
% 1.32/0.67 % (3698276)Time elapsed: 0.097 s
% 1.32/0.67 % (3698276)Peak memory usage: 11 MB
% 1.32/0.67 % (3698276)Instructions burned: 116 (million)
% 1.32/0.67 % (3698277)Instruction limit reached!
% 1.32/0.67 % (3698277)------------------------------
% 1.32/0.67 % (3698277)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (3698277)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (3698277)CaDiCaL version: 2.1.3
% 1.32/0.67 % (3698277)Termination reason: Instruction limit
% 1.32/0.67 % (3698277)Termination phase: Saturation
% 1.32/0.67 % (3698277)Time elapsed: 0.113 s
% 1.32/0.67 % (3698277)Peak memory usage: 12 MB
% 1.32/0.67 % (3698277)Instructions burned: 132 (million)
% 1.32/0.67 % (3698287)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3342284746:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.32/0.67 % TRYING [1]
% 1.32/0.67 % TRYING [2]
% 1.32/0.67 % (3698290)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4106508164:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.32/0.67 % TRYING [3]
% 1.32/0.67 % (3698278)Instruction limit reached!
% 1.32/0.67 % (3698278)------------------------------
% 1.32/0.67 % (3698278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (3698278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (3698278)CaDiCaL version: 2.1.3
% 1.32/0.67 % (3698278)Termination reason: Instruction limit
% 1.32/0.67 % (3698278)Termination phase: Saturation
% 1.32/0.67 % (3698278)Time elapsed: 0.142 s
% 1.32/0.67 % (3698278)Peak memory usage: 12 MB
% 1.32/0.67 % (3698278)Instructions burned: 159 (million)
% 1.32/0.67 % (3698292)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=1997647799:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.32/0.67 % (3698297)ott-21_1_sil=16000:fs=off:random_seed=1268429994:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.32/0.67 % (3698274) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3698267-3698274"...
% 1.32/0.67 % (3698274)...printing done.
% 1.32/0.67 % (3698274)Refutation found. Thanks to Tanya!
% 1.32/0.67 % SZS status Unsatisfiable for theBenchmark
% 1.32/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 1.32/0.67 % (3698274)------------------------------
% 1.32/0.67 % (3698274)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.32/0.67 % (3698274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.32/0.67 % (3698274)CaDiCaL version: 2.1.3
% 1.32/0.67 % (3698274)Termination reason: Refutation
% 1.32/0.67 % (3698274)Time elapsed: 0.181 s
% 1.32/0.67 % (3698274)Peak memory usage: 13 MB
% 1.32/0.67 % (3698274)Instructions burned: 198 (million)
% 1.32/0.67 % (3698267)Success in time 0.218 s
% 1.32/0.67 % Vampire exiting
%------------------------------------------------------------------------------