TSTP Solution File: SEU148+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU148+2 : TPTP v8.1.2. Released v3.3.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 : n031.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 : Sun May 5 09:20:30 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 48 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 42 ( 18 ~; 14 |; 1 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 41 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f491,plain,
$false,
inference(subsumption_resolution,[],[f479,f237]) ).
fof(f237,plain,
subset(unordered_pair(sK2,sK2),unordered_pair(sK3,sK3)),
inference(definition_unfolding,[],[f146,f145,f145]) ).
fof(f145,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f64,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/tmp/tmp.jE8Q8OWmdQ/Vampire---4.8_3201',t69_enumset1) ).
fof(f146,plain,
subset(singleton(sK2),singleton(sK3)),
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
? [X0,X1] :
( X0 != X1
& subset(singleton(X0),singleton(X1)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,negated_conjecture,
~ ! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
inference(negated_conjecture,[],[f66]) ).
fof(f66,conjecture,
! [X0,X1] :
( subset(singleton(X0),singleton(X1))
=> X0 = X1 ),
file('/export/starexec/sandbox/tmp/tmp.jE8Q8OWmdQ/Vampire---4.8_3201',t6_zfmisc_1) ).
fof(f479,plain,
~ subset(unordered_pair(sK2,sK2),unordered_pair(sK3,sK3)),
inference(unit_resulting_resolution,[],[f257,f297,f181]) ).
fof(f181,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.jE8Q8OWmdQ/Vampire---4.8_3201',d3_tarski) ).
fof(f297,plain,
~ in(sK2,unordered_pair(sK3,sK3)),
inference(unit_resulting_resolution,[],[f280,f267]) ).
fof(f267,plain,
! [X3,X0,X1] :
( ~ in(X3,unordered_pair(X0,X1))
| sP16(X3,X1,X0) ),
inference(equality_resolution,[],[f213]) ).
fof(f213,plain,
! [X2,X3,X0,X1] :
( sP16(X3,X1,X0)
| ~ in(X3,X2)
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.jE8Q8OWmdQ/Vampire---4.8_3201',d2_tarski) ).
fof(f280,plain,
~ sP16(sK2,sK3,sK3),
inference(unit_resulting_resolution,[],[f147,f147,f211]) ).
fof(f211,plain,
! [X3,X0,X1] :
( ~ sP16(X3,X1,X0)
| X1 = X3
| X0 = X3 ),
inference(cnf_transformation,[],[f10]) ).
fof(f147,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f97]) ).
fof(f257,plain,
! [X2] : in(X2,unordered_pair(X2,X2)),
inference(equality_resolution,[],[f256]) ).
fof(f256,plain,
! [X2,X1] :
( in(X2,X1)
| unordered_pair(X2,X2) != X1 ),
inference(equality_resolution,[],[f241]) ).
fof(f241,plain,
! [X2,X0,X1] :
( X0 != X2
| in(X2,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f155,f145]) ).
fof(f155,plain,
! [X2,X0,X1] :
( X0 != X2
| in(X2,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.jE8Q8OWmdQ/Vampire---4.8_3201',d1_tarski) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU148+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % 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.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:17:47 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.jE8Q8OWmdQ/Vampire---4.8_3201
% 0.55/0.73 % (3315)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.73 % (3309)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.73 % (3310)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.73 % (3311)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.73 % (3312)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.73 % (3313)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.73 % (3314)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.73 % (3315)First to succeed.
% 0.55/0.73 % (3315)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3308"
% 0.55/0.74 % (3315)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for Vampire---4
% 0.55/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.74 % (3315)------------------------------
% 0.55/0.74 % (3315)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (3315)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (3315)Memory used [KB]: 1168
% 0.55/0.74 % (3315)Time elapsed: 0.007 s
% 0.55/0.74 % (3315)Instructions burned: 15 (million)
% 0.55/0.74 % (3308)Success in time 0.371 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------