TSTP Solution File: SET950+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET950+1 : TPTP v8.1.2. Released v3.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 : 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:49:36 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 55 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 22 ~; 14 |; 12 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 54 ( 48 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f98,plain,
$false,
inference(subsumption_resolution,[],[f83,f59]) ).
fof(f59,plain,
sK3 = ordered_pair(sK6(sK1,sK2,sK3),sK7(sK1,sK2,sK3)),
inference(unit_resulting_resolution,[],[f46,f25]) ).
fof(f25,plain,
! [X3,X0,X1] :
( ~ sP5(X3,X1,X0)
| ordered_pair(sK6(X0,X1,X3),sK7(X0,X1,X3)) = X3 ),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( cartesian_product2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z8fXInjBZf/Vampire---4.8_18707',d2_zfmisc_1) ).
fof(f46,plain,
sP5(sK3,sK2,sK1),
inference(unit_resulting_resolution,[],[f45,f34]) ).
fof(f34,plain,
! [X3,X0,X1] :
( ~ in(X3,cartesian_product2(X0,X1))
| sP5(X3,X1,X0) ),
inference(equality_resolution,[],[f27]) ).
fof(f27,plain,
! [X2,X3,X0,X1] :
( sP5(X3,X1,X0)
| ~ in(X3,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f3]) ).
fof(f45,plain,
in(sK3,cartesian_product2(sK1,sK2)),
inference(unit_resulting_resolution,[],[f19,f18,f20]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ in(X2,X0)
| ~ subset(X0,X1)
| in(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.z8fXInjBZf/Vampire---4.8_18707',d3_tarski) ).
fof(f18,plain,
subset(sK0,cartesian_product2(sK1,sK2)),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
? [X0,X1,X2,X3] :
( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X2)
| ~ in(X4,X1) )
& in(X3,X0)
& subset(X0,cartesian_product2(X1,X2)) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( ! [X4,X5] :
~ ( ordered_pair(X4,X5) = X3
& in(X5,X2)
& in(X4,X1) )
& in(X3,X0)
& subset(X0,cartesian_product2(X1,X2)) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1,X2,X3] :
~ ( ! [X4,X5] :
~ ( ordered_pair(X4,X5) = X3
& in(X5,X2)
& in(X4,X1) )
& in(X3,X0)
& subset(X0,cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.z8fXInjBZf/Vampire---4.8_18707',t103_zfmisc_1) ).
fof(f19,plain,
in(sK3,sK0),
inference(cnf_transformation,[],[f14]) ).
fof(f83,plain,
sK3 != ordered_pair(sK6(sK1,sK2,sK3),sK7(sK1,sK2,sK3)),
inference(unit_resulting_resolution,[],[f57,f58,f17]) ).
fof(f17,plain,
! [X4,X5] :
( ordered_pair(X4,X5) != sK3
| ~ in(X5,sK2)
| ~ in(X4,sK1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f58,plain,
in(sK7(sK1,sK2,sK3),sK2),
inference(unit_resulting_resolution,[],[f46,f24]) ).
fof(f24,plain,
! [X3,X0,X1] :
( in(sK7(X0,X1,X3),X1)
| ~ sP5(X3,X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
fof(f57,plain,
in(sK6(sK1,sK2,sK3),sK1),
inference(unit_resulting_resolution,[],[f46,f23]) ).
fof(f23,plain,
! [X3,X0,X1] :
( in(sK6(X0,X1,X3),X0)
| ~ sP5(X3,X1,X0) ),
inference(cnf_transformation,[],[f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET950+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.15 % 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.15/0.37 % Computer : n029.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 : Tue Apr 30 17:33:35 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.z8fXInjBZf/Vampire---4.8_18707
% 0.55/0.76 % (18976)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 % (18970)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 % (18973)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 % (18971)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 % (18972)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 % (18975)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 % (18977)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 % (18976)First to succeed.
% 0.55/0.76 % (18976)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 % (18976)------------------------------
% 0.55/0.76 % (18976)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (18976)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (18976)Memory used [KB]: 1050
% 0.55/0.76 % (18976)Time elapsed: 0.003 s
% 0.55/0.76 % (18976)Instructions burned: 5 (million)
% 0.55/0.76 % (18976)------------------------------
% 0.55/0.76 % (18976)------------------------------
% 0.55/0.76 % (18966)Success in time 0.38 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------