TSTP Solution File: SET602+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET602+4 : TPTP v8.2.0. Released v2.2.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.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:12:20 EDT 2024
% Result : Theorem 0.53s 0.74s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 61 ( 26 ~; 20 |; 5 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f60,plain,
$false,
inference(avatar_sat_refutation,[],[f40,f52,f59]) ).
fof(f59,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f58,plain,
( $false
| spl2_2 ),
inference(subsumption_resolution,[],[f54,f25]) ).
fof(f25,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : ~ member(X0,empty_set),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X2] : ~ member(X2,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set) ).
fof(f54,plain,
( member(sK1(empty_set,difference(sK0,sK0)),empty_set)
| spl2_2 ),
inference(unit_resulting_resolution,[],[f39,f29]) ).
fof(f29,plain,
! [X0,X1] :
( member(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f39,plain,
( ~ subset(empty_set,difference(sK0,sK0))
| spl2_2 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f37,plain,
( spl2_2
<=> subset(empty_set,difference(sK0,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f52,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f51]) ).
fof(f51,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f47,f44]) ).
fof(f44,plain,
( ~ member(sK1(difference(sK0,sK0),empty_set),sK0)
| spl2_1 ),
inference(unit_resulting_resolution,[],[f41,f27]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( ~ member(X0,X1)
& member(X0,X2) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0,X3] :
( member(X1,difference(X3,X0))
<=> ( ~ member(X1,X0)
& member(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference) ).
fof(f41,plain,
( member(sK1(difference(sK0,sK0),empty_set),difference(sK0,sK0))
| spl2_1 ),
inference(unit_resulting_resolution,[],[f35,f29]) ).
fof(f35,plain,
( ~ subset(difference(sK0,sK0),empty_set)
| spl2_1 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl2_1
<=> subset(difference(sK0,sK0),empty_set) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f47,plain,
( member(sK1(difference(sK0,sK0),empty_set),sK0)
| spl2_1 ),
inference(resolution,[],[f41,f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f16]) ).
fof(f40,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f31,f37,f33]) ).
fof(f31,plain,
( ~ subset(empty_set,difference(sK0,sK0))
| ~ subset(difference(sK0,sK0),empty_set) ),
inference(resolution,[],[f23,f24]) ).
fof(f24,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f23,plain,
~ equal_set(difference(sK0,sK0),empty_set),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
? [X0] : ~ equal_set(difference(X0,X0),empty_set),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0] : equal_set(difference(X0,X0),empty_set),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X3] : equal_set(difference(X3,X3),empty_set),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X3] : equal_set(difference(X3,X3),empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI29) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET602+4 : TPTP v8.2.0. Released v2.2.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 11:20:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.53/0.73 % (16288)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.53/0.73 % (16284)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.73 % (16285)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.53/0.73 % (16286)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.53/0.73 % (16287)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.53/0.73 % (16283)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.53/0.73 % (16288)First to succeed.
% 0.53/0.74 % (16288)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16281"
% 0.53/0.74 % (16287)Refutation not found, incomplete strategy% (16287)------------------------------
% 0.53/0.74 % (16287)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (16288)Refutation found. Thanks to Tanya!
% 0.53/0.74 % SZS status Theorem for theBenchmark
% 0.53/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.74 % (16288)------------------------------
% 0.53/0.74 % (16288)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (16288)Termination reason: Refutation
% 0.53/0.74
% 0.53/0.74 % (16288)Memory used [KB]: 1004
% 0.53/0.74 % (16288)Time elapsed: 0.003 s
% 0.53/0.74 % (16288)Instructions burned: 3 (million)
% 0.53/0.74 % (16281)Success in time 0.384 s
% 0.53/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------