TSTP Solution File: SET949+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET949+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 113 ( 39 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 143 ( 51 ~; 42 |; 43 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 104 ( 77 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f67,plain,
$false,
inference(resolution,[],[f65,f38]) ).
fof(f38,plain,
in(sK7,cartesian_product2(sK8,sK9)),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( ! [X3,X4] : ordered_pair(X3,X4) != sK7
& in(sK7,cartesian_product2(sK8,sK9)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9])],[f11,f22]) ).
fof(f22,plain,
( ? [X0,X1,X2] :
( ! [X3,X4] : ordered_pair(X3,X4) != X0
& in(X0,cartesian_product2(X1,X2)) )
=> ( ! [X4,X3] : ordered_pair(X3,X4) != sK7
& in(sK7,cartesian_product2(sK8,sK9)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ! [X3,X4] : ordered_pair(X3,X4) != X0
& in(X0,cartesian_product2(X1,X2)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X0
& in(X0,cartesian_product2(X1,X2)) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X0
& in(X0,cartesian_product2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.lAe9Hk5TVW/Vampire---4.8_10483',t102_zfmisc_1) ).
fof(f65,plain,
! [X0,X1] : ~ in(sK7,cartesian_product2(X0,X1)),
inference(resolution,[],[f53,f51]) ).
fof(f51,plain,
! [X0,X1,X8] :
( sQ10_eqProxy(ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)),X8)
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_proxy_replacement,[],[f42,f45]) ).
fof(f45,plain,
! [X0,X1] :
( sQ10_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ10_eqProxy])]) ).
fof(f42,plain,
! [X0,X1,X8] :
( ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8
| ~ in(X8,cartesian_product2(X0,X1)) ),
inference(equality_resolution,[],[f28]) ).
fof(f28,plain,
! [X2,X0,X1,X8] :
( ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8
| ~ in(X8,X2)
| cartesian_product2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ( ( ! [X4,X5] :
( ordered_pair(X4,X5) != sK0(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( ( sK0(X0,X1,X2) = ordered_pair(sK1(X0,X1,X2),sK2(X0,X1,X2))
& in(sK2(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) )
| in(sK0(X0,X1,X2),X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ( ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8
& in(sK4(X0,X1,X8),X1)
& in(sK3(X0,X1,X8),X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f13,f16,f15,f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) )
| in(X3,X2) ) )
=> ( ( ! [X5,X4] :
( ordered_pair(X4,X5) != sK0(X0,X1,X2)
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(sK0(X0,X1,X2),X2) )
& ( ? [X7,X6] :
( ordered_pair(X6,X7) = sK0(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
| in(sK0(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ? [X7,X6] :
( ordered_pair(X6,X7) = sK0(X0,X1,X2)
& in(X7,X1)
& in(X6,X0) )
=> ( sK0(X0,X1,X2) = ordered_pair(sK1(X0,X1,X2),sK2(X0,X1,X2))
& in(sK2(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1,X8] :
( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
=> ( ordered_pair(sK3(X0,X1,X8),sK4(X0,X1,X8)) = X8
& in(sK4(X0,X1,X8),X1)
& in(sK3(X0,X1,X8),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X6,X7] :
( ordered_pair(X6,X7) = X3
& in(X7,X1)
& in(X6,X0) )
| in(X3,X2) ) ) )
& ( ! [X8] :
( ( in(X8,X2)
| ! [X9,X10] :
( ordered_pair(X9,X10) != X8
| ~ in(X10,X1)
| ~ in(X9,X0) ) )
& ( ? [X11,X12] :
( ordered_pair(X11,X12) = X8
& in(X12,X1)
& in(X11,X0) )
| ~ in(X8,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( cartesian_product2(X0,X1) = X2
| ? [X3] :
( ( ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) )
| ~ in(X3,X2) )
& ( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ! [X4,X5] :
( ordered_pair(X4,X5) != X3
| ~ in(X5,X1)
| ~ in(X4,X0) ) )
& ( ? [X4,X5] :
( ordered_pair(X4,X5) = X3
& in(X5,X1)
& in(X4,X0) )
| ~ in(X3,X2) ) )
| cartesian_product2(X0,X1) != X2 ) ),
inference(nnf_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/sandbox2/tmp/tmp.lAe9Hk5TVW/Vampire---4.8_10483',d2_zfmisc_1) ).
fof(f53,plain,
! [X3,X4] : ~ sQ10_eqProxy(ordered_pair(X3,X4),sK7),
inference(equality_proxy_replacement,[],[f39,f45]) ).
fof(f39,plain,
! [X3,X4] : ordered_pair(X3,X4) != sK7,
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12 % 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.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 30 17:30:13 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.33 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.lAe9Hk5TVW/Vampire---4.8_10483
% 0.60/0.80 % (10594)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 (2995ds/34Mi)
% 0.60/0.80 % (10596)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.80 % (10595)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 (2995ds/51Mi)
% 0.60/0.80 % (10599)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.80 % (10597)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.80 % (10598)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 (2995ds/34Mi)
% 0.60/0.80 % (10600)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 (2995ds/83Mi)
% 0.60/0.80 % (10601)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 (2995ds/56Mi)
% 0.60/0.81 % (10598)First to succeed.
% 0.60/0.81 % (10594)Also succeeded, but the first one will report.
% 0.60/0.81 % (10599)Also succeeded, but the first one will report.
% 0.60/0.81 % (10598)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (10598)------------------------------
% 0.60/0.81 % (10598)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (10598)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (10598)Memory used [KB]: 1046
% 0.60/0.81 % (10598)Time elapsed: 0.004 s
% 0.60/0.81 % (10598)Instructions burned: 4 (million)
% 0.60/0.81 % (10598)------------------------------
% 0.60/0.81 % (10598)------------------------------
% 0.60/0.81 % (10590)Success in time 0.473 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------