%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL529+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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:52:52 AM UTC 2026
% Result : Theorem 3.55s 1.45s
% Output : Refutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 65 ( 24 unt; 8 def)
% Number of atoms : 123 ( 5 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 105 ( 47 ~; 41 |; 0 &)
% ( 11 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f50,axiom,
( necessitation
<=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessitation) ).
fof(f64,axiom,
( axiom_m2
<=> ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m2) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km5_necessitation) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f88,conjecture,
axiom_m2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m2) ).
fof(f89,negated_conjecture,
~ axiom_m2,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ axiom_m2,
inference(flattening,[],[f89]) ).
fof(f91,plain,
( ! [X0,X1] : is_a_theorem(strict_implies(and(X0,X1),X0))
=> axiom_m2 ),
inference(unused_predicate_definition_removal,[],[f64]) ).
fof(f95,plain,
( necessitation
=> ! [X0] :
( is_a_theorem(X0)
=> is_a_theorem(necessarily(X0)) ) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f104,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f122,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f104]) ).
fof(f134,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ necessitation ),
inference(ennf_transformation,[],[f95]) ).
fof(f138,plain,
( axiom_m2
| ? [X0,X1] : ~ is_a_theorem(strict_implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f91]) ).
fof(f140,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(ennf_transformation,[],[f75]) ).
fof(f142,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f138]) ).
fof(f149,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f122]) ).
fof(f169,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f179,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[],[f134]) ).
fof(f183,plain,
( axiom_m2
| ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f142]) ).
fof(f185,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[],[f140]) ).
fof(f188,plain,
necessitation,
inference(cnf_transformation,[],[f78]) ).
fof(f194,plain,
op_strict_implies,
inference(cnf_transformation,[],[f85]) ).
fof(f197,plain,
~ axiom_m2,
inference(cnf_transformation,[],[f90]) ).
fof(f207,definition,
( spl2_3
<=> op_strict_implies ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f211,definition,
( spl2_4
<=> ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
introduced(definition,[new_symbols(definition,[spl2_4])],[avatar_definition]) ).
fof(f212,plain,
( ! [X0,X1] : strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f213,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f185,f211,f207]) ).
fof(f223,definition,
( spl2_7
<=> is_a_theorem(strict_implies(and(sK0,sK1),sK0)) ),
introduced(definition,[new_symbols(definition,[spl2_7])],[avatar_definition]) ).
fof(f225,plain,
( ~ is_a_theorem(strict_implies(and(sK0,sK1),sK0))
| spl2_7 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f227,definition,
( spl2_8
<=> axiom_m2 ),
introduced(definition,[new_symbols(definition,[spl2_8])],[avatar_definition]) ).
fof(f230,plain,
( ~ spl2_7
| spl2_8 ),
inference(avatar_split_clause,[],[f183,f227,f223]) ).
fof(f256,definition,
( spl2_15
<=> necessitation ),
introduced(definition,[new_symbols(definition,[spl2_15])],[avatar_definition]) ).
fof(f260,definition,
( spl2_16
<=> ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[spl2_16])],[avatar_definition]) ).
fof(f261,plain,
( ! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) )
| ~ spl2_16 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( ~ spl2_15
| spl2_16 ),
inference(avatar_split_clause,[],[f179,f260,f256]) ).
fof(f352,definition,
( spl2_39
<=> and_1 ),
introduced(definition,[new_symbols(definition,[spl2_39])],[avatar_definition]) ).
fof(f356,definition,
( spl2_40
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[spl2_40])],[avatar_definition]) ).
fof(f357,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ spl2_40 ),
inference(avatar_component_clause,[],[f356]) ).
fof(f358,plain,
( ~ spl2_39
| spl2_40 ),
inference(avatar_split_clause,[],[f149,f356,f352]) ).
fof(f407,plain,
~ spl2_8,
inference(avatar_split_clause,[],[f197,f227]) ).
fof(f436,plain,
spl2_39,
inference(avatar_split_clause,[],[f169,f352]) ).
fof(f466,plain,
spl2_15,
inference(avatar_split_clause,[],[f188,f256]) ).
fof(f478,plain,
spl2_3,
inference(avatar_split_clause,[],[f194,f207]) ).
fof(f485,plain,
( ! [X0,X1] :
( is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) )
| ~ spl2_4
| ~ spl2_16 ),
inference(superposition,[],[f261,f212]) ).
fof(f503,plain,
( ~ is_a_theorem(implies(and(sK0,sK1),sK0))
| ~ spl2_4
| spl2_7
| ~ spl2_16 ),
inference(resolution,[],[f485,f225]) ).
fof(f504,plain,
( $false
| ~ spl2_4
| spl2_7
| ~ spl2_16
| ~ spl2_40 ),
inference(forward_subsumption_resolution,[],[f503,f357]) ).
fof(f505,plain,
( ~ spl2_4
| spl2_7
| ~ spl2_16
| ~ spl2_40 ),
inference(avatar_contradiction_clause,[],[f504]) ).
cnf(s2,plain,
( ~ spl2_3
| spl2_4 ),
inference(sat_conversion,[],[f213]) ).
cnf(s4,plain,
( ~ spl2_7
| spl2_8 ),
inference(sat_conversion,[],[f230]) ).
cnf(s8,plain,
( ~ spl2_15
| spl2_16 ),
inference(sat_conversion,[],[f262]) ).
cnf(s20,plain,
( ~ spl2_39
| spl2_40 ),
inference(sat_conversion,[],[f358]) ).
cnf(s27,plain,
~ spl2_8,
inference(sat_conversion,[],[f407]) ).
cnf(s45,plain,
spl2_39,
inference(sat_conversion,[],[f436]) ).
cnf(s65,plain,
spl2_15,
inference(sat_conversion,[],[f466]) ).
cnf(s73,plain,
spl2_3,
inference(sat_conversion,[],[f478]) ).
cnf(s78,plain,
( ~ spl2_4
| spl2_7
| ~ spl2_16
| ~ spl2_40 ),
inference(sat_conversion,[],[f505]) ).
cnf(s85,plain,
spl2_40,
inference(rat,[],[s20,s45]) ).
cnf(s97,plain,
spl2_16,
inference(rat,[],[s8,s65]) ).
cnf(s101,plain,
~ spl2_7,
inference(rat,[],[s4,s27]) ).
cnf(s102,plain,
~ spl2_4,
inference(rat,[],[s78,s85,s97,s101]) ).
cnf(s104,plain,
$false,
inference(rat,[],[s2,s102,s73]) ).
fof(f506,plain,
$false,
inference(avatar_sat_refutation,[],[s104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL529+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 15:58:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.55/1.45 % (3706033)Detected formulas, will run a generic FOF schedule.
% 3.55/1.45 % (3706072)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2639662337:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.55/1.45 % (3706077)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3123095680:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.55/1.45 % (3706076)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2737163003:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.55/1.45 % (3706074)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2027329613:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.55/1.45 % (3706078)dis-21_1_sil=8000:lcm=predicate:random_seed=4089354731:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.55/1.45 % (3706075)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3461654092:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.55/1.45 % (3706073)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1660584193:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.55/1.45 % (3706076)Refutation not found, incomplete strategy
% 3.55/1.45 % (3706076)------------------------------
% 3.55/1.45 % (3706076)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.45 % (3706076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.45 % (3706076)CaDiCaL version: 2.1.3
% 3.55/1.45 % (3706075)Refutation not found, incomplete strategy
% 3.55/1.45 % (3706075)------------------------------
% 3.55/1.45 % (3706075)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.45 % (3706076)Termination reason: Refutation not found, incomplete strategy
% 3.55/1.45 % (3706076)Time elapsed: 0.001 s
% 3.55/1.45 % (3706076)Peak memory usage: 86 MB
% 3.55/1.45 % (3706075)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.45 % (3706075)CaDiCaL version: 2.1.3
% 3.55/1.45 % (3706075)Termination reason: Refutation not found, incomplete strategy
% 3.55/1.45 % (3706075)Time elapsed: 0.001 s
% 3.55/1.45 % (3706075)Peak memory usage: 87 MB
% 3.55/1.45 % (3706078)Refutation not found, incomplete strategy
% 3.55/1.45 % (3706078)------------------------------
% 3.55/1.45 % (3706078)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.45 % (3706078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.45 % (3706078)CaDiCaL version: 2.1.3
% 3.55/1.45 % (3706078)Termination reason: Refutation not found, incomplete strategy
% 3.55/1.45 % (3706078)Time elapsed: 0.002 s
% 3.55/1.45 % (3706078)Peak memory usage: 88 MB
% 3.55/1.45 % (3706078)Instructions burned: 1 (million)
% 3.55/1.45 % (3706077)First to succeed.
% 3.55/1.45 % (3706077)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3706033"
% 3.55/1.45 % (3706078)------------------------------
% 3.55/1.45 % (3706078)------------------------------
% 3.55/1.45 % (3706076)------------------------------
% 3.55/1.45 % (3706076)------------------------------
% 3.55/1.45 % (3706075)------------------------------
% 3.55/1.45 % (3706075)------------------------------
% 3.55/1.45 % (3706077)Refutation found. Thanks to Tanya!
% 3.55/1.45 % SZS status Theorem for theBenchmark
% 3.55/1.45 % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.45 % (3706077)------------------------------
% 3.55/1.45 % (3706077)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.45 % (3706077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.45 % (3706077)CaDiCaL version: 2.1.3
% 3.55/1.45 % (3706077)Termination reason: Refutation
% 3.55/1.45 % (3706077)Time elapsed: 0.007 s
% 3.55/1.45 % (3706077)Peak memory usage: 89 MB
% 3.55/1.45 % (3706077)Instructions burned: 8 (million)
% 3.55/1.45 % (3706077)------------------------------
% 3.55/1.45 % (3706077)------------------------------
% 3.55/1.45 % (3706033)Success in time 0.414 s
% 3.55/1.45 % Vampire exiting
%------------------------------------------------------------------------------