TSTP Solution File: SET200+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET200+3 : TPTP v8.1.2. 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 : n029.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 : Wed May 1 03:45:44 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 107 ( 42 ~; 31 |; 24 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 52 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f48,f51]) ).
fof(f51,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f50]) ).
fof(f50,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f49,f37]) ).
fof(f37,plain,
( member(sK4(union(sK0,sK2),union(sK1,sK3)),sK2)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl5_1
<=> member(sK4(union(sK0,sK2),union(sK1,sK3)),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f49,plain,
~ member(sK4(union(sK0,sK2),union(sK1,sK3)),sK2),
inference(resolution,[],[f44,f30]) ).
fof(f30,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f20,f26]) ).
fof(f26,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f16,f17]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,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,[],[f15]) ).
fof(f15,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,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.f0iMDsEfmx/Vampire---4.8_4993',subset_defn) ).
fof(f20,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( ~ subset(union(sK0,sK2),union(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f9,f11]) ).
fof(f11,plain,
( ? [X0,X1,X2,X3] :
( ~ subset(union(X0,X2),union(X1,X3))
& subset(X2,X3)
& subset(X0,X1) )
=> ( ~ subset(union(sK0,sK2),union(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1,X2,X3] :
( ~ subset(union(X0,X2),union(X1,X3))
& subset(X2,X3)
& subset(X0,X1) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
? [X0,X1,X2,X3] :
( ~ subset(union(X0,X2),union(X1,X3))
& subset(X2,X3)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(union(X0,X2),union(X1,X3)) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(union(X0,X2),union(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.f0iMDsEfmx/Vampire---4.8_4993',prove_th34) ).
fof(f44,plain,
~ member(sK4(union(sK0,sK2),union(sK1,sK3)),sK3),
inference(resolution,[],[f32,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.f0iMDsEfmx/Vampire---4.8_4993',union_defn) ).
fof(f32,plain,
~ member(sK4(union(sK0,sK2),union(sK1,sK3)),union(sK1,sK3)),
inference(resolution,[],[f21,f28]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK4(X0,X1),X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f21,plain,
~ subset(union(sK0,sK2),union(sK1,sK3)),
inference(cnf_transformation,[],[f12]) ).
fof(f48,plain,
~ spl5_2,
inference(avatar_split_clause,[],[f45,f39]) ).
fof(f39,plain,
( spl5_2
<=> member(sK4(union(sK0,sK2),union(sK1,sK3)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f45,plain,
~ member(sK4(union(sK0,sK2),union(sK1,sK3)),sK0),
inference(resolution,[],[f43,f29]) ).
fof(f29,plain,
! [X0] :
( member(X0,sK1)
| ~ member(X0,sK0) ),
inference(resolution,[],[f19,f26]) ).
fof(f19,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f43,plain,
~ member(sK4(union(sK0,sK2),union(sK1,sK3)),sK1),
inference(resolution,[],[f32,f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f42,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f33,f39,f35]) ).
fof(f33,plain,
( member(sK4(union(sK0,sK2),union(sK1,sK3)),sK0)
| member(sK4(union(sK0,sK2),union(sK1,sK3)),sK2) ),
inference(resolution,[],[f31,f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f31,plain,
member(sK4(union(sK0,sK2),union(sK1,sK3)),union(sK0,sK2)),
inference(resolution,[],[f21,f27]) ).
fof(f27,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK4(X0,X1),X0) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET200+3 : TPTP v8.1.2. 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.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:38:20 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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/tmp/tmp.f0iMDsEfmx/Vampire---4.8_4993
% 0.55/0.76 % (5195)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.55/0.76 % (5194)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 Vampire---4 for (2996ds/83Mi)
% 0.55/0.76 % (5195)First to succeed.
% 0.55/0.76 % (5188)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 Vampire---4 for (2996ds/34Mi)
% 0.55/0.76 % (5192)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 Vampire---4 for (2996ds/34Mi)
% 0.55/0.76 % (5191)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.55/0.76 % (5190)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.55/0.76 % (5189)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 Vampire---4 for (2996ds/51Mi)
% 0.55/0.76 % (5193)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.55/0.76 % (5194)Also succeeded, but the first one will report.
% 0.55/0.76 % (5195)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.76 % (5195)------------------------------
% 0.55/0.76 % (5195)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (5195)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (5195)Memory used [KB]: 984
% 0.55/0.76 % (5195)Time elapsed: 0.002 s
% 0.55/0.76 % (5195)Instructions burned: 3 (million)
% 0.55/0.76 % (5195)------------------------------
% 0.55/0.76 % (5195)------------------------------
% 0.55/0.76 % (5178)Success in time 0.387 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------