TSTP Solution File: SET603+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET603+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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.51s 0.72s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 12 unt; 0 def)
% Number of atoms : 116 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 114 ( 45 ~; 42 |; 16 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 61 ( 56 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f102,plain,
$false,
inference(avatar_sat_refutation,[],[f53,f67,f101]) ).
fof(f101,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f100]) ).
fof(f100,plain,
( $false
| spl2_2 ),
inference(subsumption_resolution,[],[f99,f52]) ).
fof(f52,plain,
( ~ subset(sK0,difference(sK0,empty_set))
| spl2_2 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl2_2
<=> subset(sK0,difference(sK0,empty_set)) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f99,plain,
( subset(sK0,difference(sK0,empty_set))
| spl2_2 ),
inference(subsumption_resolution,[],[f94,f34]) ).
fof(f34,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/sandbox2/benchmark/theBenchmark.p',empty_set) ).
fof(f94,plain,
( member(sK1(sK0,difference(sK0,empty_set)),empty_set)
| subset(sK0,difference(sK0,empty_set))
| spl2_2 ),
inference(resolution,[],[f73,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f73,plain,
( ! [X0] :
( member(sK1(sK0,difference(sK0,empty_set)),difference(sK0,X0))
| member(sK1(sK0,difference(sK0,empty_set)),X0) )
| spl2_2 ),
inference(resolution,[],[f69,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| member(X0,X1)
| member(X0,difference(X2,X1)) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) )
& ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) )
& ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(nnf_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/sandbox2/benchmark/theBenchmark.p',difference) ).
fof(f69,plain,
( member(sK1(sK0,difference(sK0,empty_set)),sK0)
| spl2_2 ),
inference(resolution,[],[f52,f41]) ).
fof(f41,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f67,plain,
spl2_1,
inference(avatar_contradiction_clause,[],[f66]) ).
fof(f66,plain,
( $false
| spl2_1 ),
inference(subsumption_resolution,[],[f63,f48]) ).
fof(f48,plain,
( ~ subset(difference(sK0,empty_set),sK0)
| spl2_1 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f46,plain,
( spl2_1
<=> subset(difference(sK0,empty_set),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f63,plain,
( subset(difference(sK0,empty_set),sK0)
| spl2_1 ),
inference(resolution,[],[f56,f42]) ).
fof(f56,plain,
( member(sK1(difference(sK0,empty_set),sK0),sK0)
| spl2_1 ),
inference(resolution,[],[f54,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ member(X0,difference(X2,X1))
| member(X0,X2) ),
inference(cnf_transformation,[],[f26]) ).
fof(f54,plain,
( member(sK1(difference(sK0,empty_set),sK0),difference(sK0,empty_set))
| spl2_1 ),
inference(resolution,[],[f48,f41]) ).
fof(f53,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f44,f50,f46]) ).
fof(f44,plain,
( ~ subset(sK0,difference(sK0,empty_set))
| ~ subset(difference(sK0,empty_set),sK0) ),
inference(resolution,[],[f33,f32]) ).
fof(f32,plain,
~ equal_set(difference(sK0,empty_set),sK0),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
~ equal_set(difference(sK0,empty_set),sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f23]) ).
fof(f23,plain,
( ? [X0] : ~ equal_set(difference(X0,empty_set),X0)
=> ~ equal_set(difference(sK0,empty_set),sK0) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0] : ~ equal_set(difference(X0,empty_set),X0),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0] : equal_set(difference(X0,empty_set),X0),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X3] : equal_set(difference(X3,empty_set),X3),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X3] : equal_set(difference(X3,empty_set),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI30) ).
fof(f33,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,[],[f18]) ).
fof(f18,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/sandbox2/benchmark/theBenchmark.p',equal_set) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET603+4 : TPTP v8.2.0. Released v2.2.0.
% 0.07/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.15/0.37 % Computer : n003.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 12:46:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.51/0.72 % (32256)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.72 % (32257)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.51/0.72 % (32261)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.51/0.72 % (32259)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.51/0.72 % (32256)First to succeed.
% 0.51/0.72 % (32261)Also succeeded, but the first one will report.
% 0.51/0.72 % (32256)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32253"
% 0.51/0.72 % (32254)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.51/0.72 % (32259)Refutation not found, incomplete strategy% (32259)------------------------------
% 0.51/0.72 % (32259)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.72 % (32259)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.72
% 0.51/0.72 % (32259)Memory used [KB]: 972
% 0.51/0.72 % (32259)Time elapsed: 0.003 s
% 0.51/0.72 % (32259)Instructions burned: 2 (million)
% 0.51/0.72 % (32256)Refutation found. Thanks to Tanya!
% 0.51/0.72 % SZS status Theorem for theBenchmark
% 0.51/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.72 % (32256)------------------------------
% 0.51/0.72 % (32256)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.72 % (32256)Termination reason: Refutation
% 0.51/0.72
% 0.51/0.72 % (32256)Memory used [KB]: 1079
% 0.51/0.72 % (32256)Time elapsed: 0.003 s
% 0.51/0.72 % (32256)Instructions burned: 5 (million)
% 0.51/0.72 % (32253)Success in time 0.341 s
% 0.51/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------