TSTP Solution File: SET576+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET576+3 : 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 : n022.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:09 EDT 2024
% Result : Theorem 0.47s 0.68s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 78 ( 36 ~; 20 |; 13 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 37 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,plain,
$false,
inference(subsumption_resolution,[],[f27,f23]) ).
fof(f23,plain,
intersect(sK0,sK1),
inference(resolution,[],[f17,f21]) ).
fof(f21,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
=> disjoint(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f17,plain,
~ disjoint(sK0,sK1),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ~ disjoint(sK0,sK1)
& ! [X2] :
( ~ member(X2,sK1)
| ~ member(X2,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f10]) ).
fof(f10,plain,
( ? [X0,X1] :
( ~ disjoint(X0,X1)
& ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
=> ( ~ disjoint(sK0,sK1)
& ! [X2] :
( ~ member(X2,sK1)
| ~ member(X2,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
? [X0,X1] :
( ~ disjoint(X0,X1)
& ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th17) ).
fof(f27,plain,
~ intersect(sK0,sK1),
inference(duplicate_literal_removal,[],[f26]) ).
fof(f26,plain,
( ~ intersect(sK0,sK1)
| ~ intersect(sK0,sK1) ),
inference(resolution,[],[f24,f18]) ).
fof(f18,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(f24,plain,
! [X0] :
( ~ member(sK2(X0,sK1),sK0)
| ~ intersect(X0,sK1) ),
inference(resolution,[],[f16,f19]) ).
fof(f19,plain,
! [X0,X1] :
( member(sK2(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f16,plain,
! [X2] :
( ~ member(X2,sK1)
| ~ member(X2,sK0) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET576+3 : TPTP v8.2.0. Released v2.2.0.
% 0.09/0.11 % 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.10/0.31 % Computer : n022.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 12:18:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_NEQ problem
% 0.10/0.31 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.47/0.68 % (12963)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.47/0.68 % (12958)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.68 % (12959)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.47/0.68 % (12960)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.47/0.68 % (12961)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.47/0.68 % (12957)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.47/0.68 % (12962)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.47/0.68 % (12963)First to succeed.
% 0.47/0.68 % (12963)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12849"
% 0.47/0.68 % (12959)Also succeeded, but the first one will report.
% 0.47/0.68 % (12960)Also succeeded, but the first one will report.
% 0.47/0.68 % (12961)Also succeeded, but the first one will report.
% 0.47/0.68 % (12958)Also succeeded, but the first one will report.
% 0.47/0.68 % (12957)Also succeeded, but the first one will report.
% 0.47/0.68 % (12963)Refutation found. Thanks to Tanya!
% 0.47/0.68 % SZS status Theorem for theBenchmark
% 0.47/0.68 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.68 % (12963)------------------------------
% 0.47/0.68 % (12963)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.68 % (12963)Termination reason: Refutation
% 0.47/0.68
% 0.47/0.68 % (12963)Memory used [KB]: 973
% 0.47/0.68 % (12963)Time elapsed: 0.002 s
% 0.47/0.68 % (12963)Instructions burned: 3 (million)
% 0.47/0.68 % (12849)Success in time 0.359 s
% 0.47/0.68 % Vampire---4.8 exiting
%------------------------------------------------------------------------------