TSTP Solution File: SET148+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET148+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 : n011.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:25 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 34 ( 18 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 33 ( 16 ~; 9 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 20 ( 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f50,plain,
$false,
inference(trivial_inequality_removal,[],[f49]) ).
fof(f49,plain,
sK0 != sK0,
inference(superposition,[],[f27,f48]) ).
fof(f48,plain,
! [X0] : intersection(X0,X0) = X0,
inference(resolution,[],[f36,f46]) ).
fof(f46,plain,
! [X1] : subset(X1,X1),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X1,X0)
| X0 != X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NfN0e7FjVH/Vampire---4.8_16543',equal_defn) ).
fof(f36,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| intersection(X0,X1) = X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( intersection(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.NfN0e7FjVH/Vampire---4.8_16543',subset_intersection) ).
fof(f27,plain,
sK0 != intersection(sK0,sK0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
sK0 != intersection(sK0,sK0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f13]) ).
fof(f13,plain,
( ? [X0] : intersection(X0,X0) != X0
=> sK0 != intersection(sK0,sK0) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0] : intersection(X0,X0) != X0,
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0] : intersection(X0,X0) = X0,
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0] : intersection(X0,X0) = X0,
file('/export/starexec/sandbox2/tmp/tmp.NfN0e7FjVH/Vampire---4.8_16543',prove_idempotency_of_intersection) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET148+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/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.16/0.36 % Computer : n011.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 17:17:17 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.NfN0e7FjVH/Vampire---4.8_16543
% 0.58/0.75 % (16750)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.58/0.75 % (16755)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.58/0.75 % (16755)Refutation not found, incomplete strategy% (16755)------------------------------
% 0.58/0.75 % (16755)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (16755)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (16755)Memory used [KB]: 954
% 0.58/0.75 % (16755)Time elapsed: 0.003 s
% 0.58/0.75 % (16755)Instructions burned: 2 (million)
% 0.58/0.75 % (16755)------------------------------
% 0.58/0.75 % (16755)------------------------------
% 0.58/0.75 % (16750)First to succeed.
% 0.58/0.75 % (16748)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.58/0.75 % (16751)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.58/0.75 % (16749)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.58/0.75 % (16752)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.58/0.75 % (16753)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.58/0.76 % (16754)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.58/0.76 % (16750)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (16750)------------------------------
% 0.58/0.76 % (16750)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.76 % (16750)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (16750)Memory used [KB]: 979
% 0.58/0.76 % (16750)Time elapsed: 0.004 s
% 0.58/0.76 % (16750)Instructions burned: 3 (million)
% 0.58/0.76 % (16750)------------------------------
% 0.58/0.76 % (16750)------------------------------
% 0.58/0.76 % (16726)Success in time 0.379 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------