TSTP Solution File: SEU527_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU527_8 : TPTP v8.2.0. Released v8.0.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 : n023.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 03:49:22 EDT 2024
% Result : Theorem 0.56s 0.74s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 52 ( 15 unt; 1 typ; 0 def)
% Number of atoms : 238 ( 39 equ)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 153 ( 50 ~; 44 |; 15 &)
% ( 8 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 121 ( 92 fml; 29 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 16 ( 13 usr; 12 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 75 ( 68 !; 6 ?; 36 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f89,plain,
$false,
inference(avatar_sat_refutation,[],[f66,f74,f75,f76,f78,f88]) ).
tff(f88,plain,
( ~ spl3_5
| ~ spl3_8 ),
inference(avatar_contradiction_clause,[],[f87]) ).
tff(f87,plain,
( $false
| ~ spl3_5
| ~ spl3_8 ),
inference(subsumption_resolution,[],[f86,f34]) ).
tff(f34,plain,
~ sQ2_eqProxy($i,sK0,sK1),
inference(equality_proxy_replacement,[],[f24,f33]) ).
tff(f33,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ2_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ2_eqProxy])]) ).
tff(f24,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
( ( sK0 != sK1 )
& in(sK0,setadjoin(sK1,emptyset))
& setadjoinE
& emptysetE ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f19]) ).
tff(f19,plain,
( ? [X0,X1] :
( ( X0 != X1 )
& in(X0,setadjoin(X1,emptyset)) )
=> ( ( sK0 != sK1 )
& in(sK0,setadjoin(sK1,emptyset)) ) ),
introduced(choice_axiom,[]) ).
tff(f15,plain,
( ? [X0,X1] :
( ( X0 != X1 )
& in(X0,setadjoin(X1,emptyset)) )
& setadjoinE
& emptysetE ),
inference(flattening,[],[f14]) ).
tff(f14,plain,
( ? [X0,X1] :
( ( X0 != X1 )
& in(X0,setadjoin(X1,emptyset)) )
& setadjoinE
& emptysetE ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
~ ( emptysetE
=> ( setadjoinE
=> ! [X0,X1] :
( in(X0,setadjoin(X1,emptyset))
=> ( X0 = X1 ) ) ) ),
inference(rectify,[],[f4]) ).
tff(f4,negated_conjecture,
~ ( emptysetE
=> ( setadjoinE
=> ! [X0,X3] :
( in(X0,setadjoin(X3,emptyset))
=> ( X0 = X3 ) ) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
( emptysetE
=> ( setadjoinE
=> ! [X0,X3] :
( in(X0,setadjoin(X3,emptyset))
=> ( X0 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uniqinunit) ).
tff(f86,plain,
( sQ2_eqProxy($i,sK0,sK1)
| ~ spl3_5
| ~ spl3_8 ),
inference(forward_literal_rewriting,[],[f85,f43]) ).
tff(f43,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ2_eqProxy(X0,X2,X1)
| ~ sQ2_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f33]) ).
tff(f85,plain,
( sQ2_eqProxy($i,sK1,sK0)
| ~ spl3_5
| ~ spl3_8 ),
inference(subsumption_resolution,[],[f84,f73]) ).
tff(f73,plain,
( ! [X0: $i] : ~ in(X0,emptyset)
| ~ spl3_8 ),
inference(avatar_component_clause,[],[f72]) ).
tff(f72,plain,
( spl3_8
<=> ! [X0] : ~ in(X0,emptyset) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_8])]) ).
tff(f84,plain,
( in(sK0,emptyset)
| sQ2_eqProxy($i,sK1,sK0)
| ~ spl3_5 ),
inference(resolution,[],[f62,f23]) ).
tff(f23,plain,
in(sK0,setadjoin(sK1,emptyset)),
inference(cnf_transformation,[],[f20]) ).
tff(f62,plain,
( ! [X2: $i,X0: $i,X1: $i] :
( ~ in(X2,setadjoin(X0,X1))
| in(X2,X1)
| sQ2_eqProxy($i,X0,X2) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f61]) ).
tff(f61,plain,
( spl3_5
<=> ! [X2,X0,X1] :
( in(X2,X1)
| ~ in(X2,setadjoin(X0,X1))
| sQ2_eqProxy($i,X0,X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
tff(f78,plain,
~ spl3_6,
inference(avatar_contradiction_clause,[],[f77]) ).
tff(f77,plain,
( $false
| ~ spl3_6 ),
inference(resolution,[],[f65,f40]) ).
tff(f40,plain,
~ sQ2_eqProxy($o,$true,$false),
inference(equality_proxy_replacement,[],[f5,f33]) ).
tff(f5,plain,
$true != $false,
introduced(fool_axiom,[]) ).
tff(f65,plain,
( ! [X3: $o] : sQ2_eqProxy($o,$true,(X3))
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f64]) ).
tff(f64,plain,
( spl3_6
<=> ! [X3: $o] : sQ2_eqProxy($o,$true,(X3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
tff(f76,plain,
spl3_1,
inference(avatar_split_clause,[],[f22,f45]) ).
tff(f45,plain,
( spl3_1
<=> setadjoinE ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
tff(f22,plain,
setadjoinE,
inference(cnf_transformation,[],[f20]) ).
tff(f75,plain,
spl3_7,
inference(avatar_split_clause,[],[f21,f68]) ).
tff(f68,plain,
( spl3_7
<=> emptysetE ),
introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).
tff(f21,plain,
emptysetE,
inference(cnf_transformation,[],[f20]) ).
tff(f74,plain,
( ~ spl3_7
| spl3_8
| spl3_6 ),
inference(avatar_split_clause,[],[f39,f64,f72,f68]) ).
tff(f39,plain,
! [X0: $i,X1: $o] :
( sQ2_eqProxy($o,$true,(X1))
| ~ in(X0,emptyset)
| ~ emptysetE ),
inference(equality_proxy_replacement,[],[f29,f33]) ).
tff(f29,plain,
! [X0: $i,X1: $o] :
( ( $true = (X1) )
| ~ in(X0,emptyset)
| ~ emptysetE ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( ! [X0] :
( ! [X1: $o] : ( $true = (X1) )
| ~ in(X0,emptyset) )
| ~ emptysetE ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
( emptysetE
=> ! [X0] :
( in(X0,emptyset)
=> ! [X1: $o] : ( $true = (X1) ) ) ),
inference(unused_predicate_definition_removal,[],[f8]) ).
tff(f8,plain,
( emptysetE
<=> ! [X0] :
( in(X0,emptyset)
=> ! [X1: $o] : ( $true = (X1) ) ) ),
inference(fool_elimination,[],[f7]) ).
tff(f7,plain,
( emptysetE
= ( ! [X0] :
( in(X0,emptyset)
=> ! [X1: $o] : (X1) ) ) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
( emptysetE
= ( ! [X0] :
( in(X0,emptyset)
=> ! [X1: $o] : (X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',emptysetE) ).
tff(f66,plain,
( ~ spl3_1
| spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f38,f64,f61,f45]) ).
tff(f38,plain,
! [X2: $i,X3: $o,X0: $i,X1: $i] :
( sQ2_eqProxy($o,$true,(X3))
| in(X2,X1)
| sQ2_eqProxy($i,X0,X2)
| ~ in(X2,setadjoin(X0,X1))
| ~ setadjoinE ),
inference(equality_proxy_replacement,[],[f25,f33]) ).
tff(f25,plain,
! [X2: $i,X3: $o,X0: $i,X1: $i] :
( ( $true = (X3) )
| in(X2,X1)
| ( X0 = X2 )
| ~ in(X2,setadjoin(X0,X1))
| ~ setadjoinE ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( ! [X0,X1,X2] :
( ! [X3: $o] :
( ( $true = (X3) )
| ( ( $true != (X3) )
& in(X2,X1) )
| ( ( $true != (X3) )
& ( X0 = X2 ) ) )
| ~ in(X2,setadjoin(X0,X1)) )
| ~ setadjoinE ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
( ! [X0,X1,X2] :
( ! [X3: $o] :
( ( $true = (X3) )
| ( ( $true != (X3) )
& in(X2,X1) )
| ( ( $true != (X3) )
& ( X0 = X2 ) ) )
| ~ in(X2,setadjoin(X0,X1)) )
| ~ setadjoinE ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
( setadjoinE
=> ! [X0,X1,X2] :
( in(X2,setadjoin(X0,X1))
=> ! [X3: $o] :
( ( ( X0 = X2 )
=> ( $true = (X3) ) )
=> ( ( in(X2,X1)
=> ( $true = (X3) ) )
=> ( $true = (X3) ) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
tff(f10,plain,
( setadjoinE
<=> ! [X0,X1,X2] :
( in(X2,setadjoin(X0,X1))
=> ! [X3: $o] :
( ( ( X0 = X2 )
=> ( $true = (X3) ) )
=> ( ( in(X2,X1)
=> ( $true = (X3) ) )
=> ( $true = (X3) ) ) ) ) ),
inference(fool_elimination,[],[f9]) ).
tff(f9,plain,
( setadjoinE
= ( ! [X0,X1,X2] :
( in(X2,setadjoin(X0,X1))
=> ! [X3: $o] :
( ( ( X0 = X2 )
=> (X3) )
=> ( ( in(X2,X1)
=> (X3) )
=> (X3) ) ) ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
( setadjoinE
= ( ! [X0,X2,X3] :
( in(X3,setadjoin(X0,X2))
=> ! [X1: $o] :
( ( ( X0 = X3 )
=> (X1) )
=> ( ( in(X3,X2)
=> (X1) )
=> (X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setadjoinE) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU527_8 : TPTP v8.2.0. Released v8.0.0.
% 0.14/0.15 % 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.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:43:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TX0_THM_EQU_NAR problem
% 0.14/0.36 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.56/0.74 % (6706)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.56/0.74 % (6709)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.56/0.74 % (6708)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.74 % (6712)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.56/0.74 % (6710)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.56/0.74 % (6707)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.56/0.74 % (6713)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.56/0.74 % (6706)First to succeed.
% 0.56/0.74 % (6706)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6705"
% 0.56/0.74 % (6709)Refutation not found, incomplete strategy% (6709)------------------------------
% 0.56/0.74 % (6709)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (6709)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (6709)Memory used [KB]: 963
% 0.56/0.74 % (6709)Time elapsed: 0.003 s
% 0.56/0.74 % (6710)Refutation not found, incomplete strategy% (6710)------------------------------
% 0.56/0.74 % (6710)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (6710)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (6710)Memory used [KB]: 981
% 0.56/0.74 % (6710)Time elapsed: 0.003 s
% 0.56/0.74 % (6712)Also succeeded, but the first one will report.
% 0.56/0.74 % (6710)Instructions burned: 2 (million)
% 0.56/0.74 % (6709)Instructions burned: 2 (million)
% 0.56/0.74 % (6713)Refutation not found, incomplete strategy% (6713)------------------------------
% 0.56/0.74 % (6713)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (6713)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.74
% 0.56/0.74 % (6713)Memory used [KB]: 957
% 0.56/0.74 % (6713)Time elapsed: 0.003 s
% 0.56/0.74 % (6713)Instructions burned: 2 (million)
% 0.56/0.74 % (6708)Also succeeded, but the first one will report.
% 0.56/0.74 % (6710)------------------------------
% 0.56/0.74 % (6710)------------------------------
% 0.56/0.74 % (6709)------------------------------
% 0.56/0.74 % (6709)------------------------------
% 0.56/0.74 % (6713)------------------------------
% 0.56/0.74 % (6713)------------------------------
% 0.56/0.74 % (6706)Refutation found. Thanks to Tanya!
% 0.56/0.74 % SZS status Theorem for theBenchmark
% 0.56/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.74 % (6706)------------------------------
% 0.56/0.74 % (6706)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.74 % (6706)Termination reason: Refutation
% 0.56/0.74
% 0.56/0.74 % (6706)Memory used [KB]: 999
% 0.56/0.74 % (6706)Time elapsed: 0.003 s
% 0.56/0.74 % (6706)Instructions burned: 4 (million)
% 0.56/0.74 % (6705)Success in time 0.37 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------