TSTP Solution File: LCL452+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL452+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:15:14 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 52 ( 15 unt; 0 def)
% Number of atoms : 97 ( 11 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 79 ( 34 ~; 29 |; 0 &)
% ( 11 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 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 : 44 ( 40 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f380,plain,
$false,
inference(avatar_sat_refutation,[],[f227,f276,f284,f292,f302,f312,f319,f321,f379]) ).
fof(f379,plain,
( ~ spl2_20
| spl2_31
| ~ spl2_34
| ~ spl2_36 ),
inference(avatar_contradiction_clause,[],[f377]) ).
fof(f377,plain,
( $false
| ~ spl2_20
| spl2_31
| ~ spl2_34
| ~ spl2_36 ),
inference(resolution,[],[f356,f226]) ).
fof(f226,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ spl2_20 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f225,plain,
( spl2_20
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_20])]) ).
fof(f356,plain,
( ~ is_a_theorem(implies(sK0,or(sK0,sK1)))
| spl2_31
| ~ spl2_34
| ~ spl2_36 ),
inference(superposition,[],[f271,f345]) ).
fof(f345,plain,
( ! [X0,X1] : or(X0,X1) = implies(not(X0),X1)
| ~ spl2_34
| ~ spl2_36 ),
inference(superposition,[],[f283,f291]) ).
fof(f291,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ spl2_36 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f290,plain,
( spl2_36
<=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_36])]) ).
fof(f283,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ spl2_34 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f282,plain,
( spl2_34
<=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_34])]) ).
fof(f271,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| spl2_31 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f269,plain,
( spl2_31
<=> is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_31])]) ).
fof(f321,plain,
~ spl2_32,
inference(avatar_split_clause,[],[f147,f273]) ).
fof(f273,plain,
( spl2_32
<=> cn2 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_32])]) ).
fof(f147,plain,
~ cn2,
inference(cnf_transformation,[],[f66]) ).
fof(f66,plain,
~ cn2,
inference(flattening,[],[f54]) ).
fof(f54,negated_conjecture,
~ cn2,
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(f319,plain,
spl2_33,
inference(avatar_split_clause,[],[f145,f278]) ).
fof(f278,plain,
( spl2_33
<=> op_or ),
introduced(avatar_definition,[new_symbols(naming,[spl2_33])]) ).
fof(f145,plain,
op_or,
inference(cnf_transformation,[],[f50]) ).
fof(f50,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_op_or) ).
fof(f312,plain,
spl2_19,
inference(avatar_split_clause,[],[f138,f221]) ).
fof(f221,plain,
( spl2_19
<=> or_1 ),
introduced(avatar_definition,[new_symbols(naming,[spl2_19])]) ).
fof(f138,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f302,plain,
spl2_35,
inference(avatar_split_clause,[],[f128,f286]) ).
fof(f286,plain,
( spl2_35
<=> op_implies_and ),
introduced(avatar_definition,[new_symbols(naming,[spl2_35])]) ).
fof(f128,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f292,plain,
( ~ spl2_35
| spl2_36 ),
inference(avatar_split_clause,[],[f125,f290,f286]) ).
fof(f125,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f104]) ).
fof(f104,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_implies_and) ).
fof(f284,plain,
( ~ spl2_33
| spl2_34 ),
inference(avatar_split_clause,[],[f124,f282,f278]) ).
fof(f124,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',op_or) ).
fof(f276,plain,
( ~ spl2_31
| spl2_32 ),
inference(avatar_split_clause,[],[f123,f273,f269]) ).
fof(f123,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f102,f106]) ).
fof(f106,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
=> ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f59]) ).
fof(f59,plain,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn2) ).
fof(f227,plain,
( ~ spl2_19
| spl2_20 ),
inference(avatar_split_clause,[],[f117,f225,f221]) ).
fof(f117,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL452+1 : TPTP v8.2.0. Released v3.3.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 03:57:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.73 % (12133)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.73 % (12135)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.73 % (12134)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.73 % (12133)Refutation not found, incomplete strategy% (12133)------------------------------
% 0.55/0.73 % (12133)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12133)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12133)Memory used [KB]: 1010
% 0.55/0.73 % (12133)Time elapsed: 0.001 s
% 0.55/0.73 % (12133)Instructions burned: 2 (million)
% 0.55/0.73 % (12136)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.55/0.73 % (12137)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.73 % (12133)------------------------------
% 0.55/0.73 % (12133)------------------------------
% 0.55/0.73 % (12135)Refutation not found, incomplete strategy% (12135)------------------------------
% 0.55/0.73 % (12135)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12135)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12137)Refutation not found, incomplete strategy% (12137)------------------------------
% 0.55/0.73 % (12137)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12135)Memory used [KB]: 1010
% 0.55/0.73 % (12135)Time elapsed: 0.002 s
% 0.55/0.73 % (12135)Instructions burned: 2 (million)
% 0.55/0.73 % (12137)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12137)Memory used [KB]: 1010
% 0.55/0.73 % (12131)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.55/0.73 % (12137)Time elapsed: 0.002 s
% 0.55/0.73 % (12137)Instructions burned: 2 (million)
% 0.55/0.73 % (12136)Refutation not found, incomplete strategy% (12136)------------------------------
% 0.55/0.73 % (12136)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12136)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12136)Memory used [KB]: 1010
% 0.55/0.73 % (12136)Time elapsed: 0.002 s
% 0.55/0.73 % (12136)Instructions burned: 2 (million)
% 0.55/0.73 % (12135)------------------------------
% 0.55/0.73 % (12135)------------------------------
% 0.55/0.73 % (12137)------------------------------
% 0.55/0.73 % (12137)------------------------------
% 0.55/0.73 % (12136)------------------------------
% 0.55/0.73 % (12136)------------------------------
% 0.55/0.73 % (12134)Refutation not found, incomplete strategy% (12134)------------------------------
% 0.55/0.73 % (12134)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12134)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12134)Memory used [KB]: 1096
% 0.55/0.73 % (12134)Time elapsed: 0.003 s
% 0.55/0.73 % (12134)Instructions burned: 3 (million)
% 0.55/0.73 % (12134)------------------------------
% 0.55/0.73 % (12134)------------------------------
% 0.55/0.73 % (12130)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.73 % (12130)Refutation not found, incomplete strategy% (12130)------------------------------
% 0.55/0.73 % (12130)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12130)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12130)Memory used [KB]: 1010
% 0.55/0.73 % (12130)Time elapsed: 0.003 s
% 0.55/0.73 % (12130)Instructions burned: 2 (million)
% 0.55/0.73 % (12130)------------------------------
% 0.55/0.73 % (12130)------------------------------
% 0.55/0.73 % (12138)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.55/0.73 % (12132)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73 % (12138)Refutation not found, incomplete strategy% (12138)------------------------------
% 0.55/0.73 % (12138)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12138)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12138)Memory used [KB]: 1088
% 0.55/0.73 % (12138)Time elapsed: 0.002 s
% 0.55/0.73 % (12138)Instructions burned: 3 (million)
% 0.55/0.73 % (12138)------------------------------
% 0.55/0.73 % (12138)------------------------------
% 0.55/0.73 % (12139)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.55/0.73 % (12141)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2996ds/52Mi)
% 0.55/0.73 % (12142)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2996ds/518Mi)
% 0.55/0.73 % (12131)First to succeed.
% 0.55/0.73 % (12142)Refutation not found, incomplete strategy% (12142)------------------------------
% 0.55/0.73 % (12142)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12142)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.73
% 0.55/0.73 % (12142)Memory used [KB]: 1011
% 0.55/0.73 % (12142)Time elapsed: 0.002 s
% 0.55/0.73 % (12142)Instructions burned: 2 (million)
% 0.55/0.73 % (12142)------------------------------
% 0.55/0.73 % (12142)------------------------------
% 0.55/0.73 % (12131)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12129"
% 0.55/0.73 % (12144)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2996ds/243Mi)
% 0.55/0.73 % (12131)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (12131)------------------------------
% 0.55/0.73 % (12131)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12131)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (12131)Memory used [KB]: 1188
% 0.55/0.73 % (12131)Time elapsed: 0.007 s
% 0.55/0.73 % (12131)Instructions burned: 8 (million)
% 0.55/0.73 % (12129)Success in time 0.378 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------